7 citations · 9 across the 6 of their papers we have counts for
6 papers
Quantum Circuits for Fixed Substring Matching Problems
Domenico Cantone, Simone Faro, Arianna Pavone +1
Quantum computation represents a computational paradigm whose distinctive attributes confer the ability to devise algorithms with asymptotic performance levels significantly superi…
An Application of Farkas' Lemma to Finite-Valued Constraint Satisfaction Problems over Infinite Domains
Friedrich Martin Schneider, Caterina Viola
We show a universal algebraic local characterisation of the expressive power of finite-valued languages with domains of arbitrary cardinality and containing arbitrary many cost fun…
The combined basic LP and affine IP relaxation for promise VCSPs on infinite domains
Caterina Viola, Stanislav Zivny
Convex relaxations have been instrumental in solvability of constraint satisfaction problems (CSPs), as well as in the three different generalisations of CSPs: valued CSPs, infinit…
Piecewise Linear Valued Constraint Satisfaction Problems with Fixed Number of Variables
Manuel Bodirsky, Marcello Mamino, Caterina Viola
Many combinatorial optimisation problems can be modelled as valued constraint satisfaction problems. In this paper, we present a polynomial-time algorithm solving the valued constr…
Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation
Manuel Bodirsky, Marcello Mamino, Caterina Viola
Valued constraint satisfaction problems (VCSPs) are a large class of combinatorial optimisation problems. The computational complexity of VCSPs depends on the set of allowed cost f…
Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains
Manuel Bodirsky, Marcello Mamino, Caterina Viola
Valued constraint satisfaction problems (VCSPs) are a large class of combinatorial optimisation problems. It is desirable to classify the computational complexity of VCSPs dependin…