6 citations · 11 across the 3 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2017★ 6 cited
The complexity of Boolean surjective general-valued CSPs
Peter Fulla, Hannes Uppman, Stanislav Zivny
Valued constraint satisfaction problems (VCSPs) are discrete optimisation problems with a -valued objective function given as a sum of fixed-arity funct…
cs.CC2016
On Planar Valued CSPs
Peter Fulla, Stanislav Zivny
We study the computational complexity of planar valued constraint satisfaction problems (VCSPs), which require the incidence graph of the instance be planar. First, we show that in…
cs.CC2015★ 5 cited
A Galois Connection for Weighted (Relational) Clones of Infinite Size
Peter Fulla, Stanislav Zivny
A Galois connection between clones and relational clones on a fixed finite domain is one of the cornerstones of the so-called algebraic approach to the computational complexity of…