research
∙
09/03/2023
Longest Common Substring and Longest Palindromic Substring in 𝒪̃(√(n)) Time
The Longest Common Substring (LCS) and Longest Palindromic Substring (LP...
share
research
∙
08/22/2023
Quantum Circuits for Fixed Substring Matching Problems
Quantum computation represents a computational paradigm whose distinctiv...
research
∙
08/09/2022
An Application of Farkas' Lemma to Finite-Valued Constraint Satisfaction Problems over Infinite Domains
We show a universal algebraic local characterisation of the expressive p...
research
∙
07/03/2020
The combined basic LP and affine IP relaxation for promise VCSPs on infinite domains
Convex relaxations have been instrumental in solvability of constraint s...
research
∙
03/02/2020
Piecewise Linear Valued Constraint Satisfaction Problems with Fixed Number of Variables
Many combinatorial optimisation problems can be modelled as valued const...
research
∙
12/18/2019
Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation
Valued constraint satisfaction problems (VCSPs) are a large class of com...
research
∙
04/05/2018
