( en | de | ru )

 

Disambiguation of "Zivný, Stanislav"

Author of the publication

copydeleteadd this publication to your clipboard
The Complexity of Approximately Counting Retractions.

, , and . ACM Trans. Comput. Theory, 12 (3): 15:1-15:43 (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Stanislav Zivny

Stanislav Laznicka

Stanislav Novak

Stanislav Keranov

Stanislav Mráz

 

Other publications of authors with the same name

The complexity of conservative finite-valued CSPs, and . CoRR, (2010)Functional Clones and Expressibility of Partition Functions., , , , and . CoRR, (2016)A tractable class of binary VCSPs via M-convex intersection., , , and . CoRR, (2018)Binary constraint satisfaction problems defined by excluded topological minors., , , and . Inf. Comput., (2019)Hybrid Tractable Classes of Constraint Problems., and . The Constraint Satisfaction Problem, volume 7 of Dagstuhl Follow-Ups, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)The Complexity of Valued Constraint Satisfaction Problems. Cognitive Technologies Springer, (2012)A Characterisation of the Complexity of Forbidding Subproblems in Binary Max-CSP., , and . CP, volume 7514 of Lecture Notes in Computer Science, page 265-273. Springer, (2012)Sparsification of Binary CSPs., and . STACS, volume 126 of LIPIcs, page 17:1-17:8. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection., , , and . MFCS, volume 6907 of Lecture Notes in Computer Science, page 231-242. Springer, (2011)Structural properties of oracle classes.. Inf. Process. Lett., 109 (19): 1131-1135 (2009)