Libor Barto

Jednostki:

Publikacje:

15.
Absorption in Universal Algebra and CSP, (2017), "The Constraint Satisfaction Problem: Complexity and Approximability", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
11.
Robust Satisfiability of Constraint Satisfaction Problems, PROCEEDINGS OF THE 44TH ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC'12 (2012), 931-940
10.
Near unanimity constraints have bounded pathwidth duality, PROCEEDINGS OF THE 27TH IEEE/ACM SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE LICS'12 (2012), 125-134
7.
New conditions for Taylor varieties and CSP, PROCEEDINGS OF THE 25TH IEEE/ACM SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE LICS'10 (2010), 100-109
3.
Constraint Satisfaction Problems of Bounded Width, PROCEEDINGS OF THE 50TH SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, FOCS'09 (2009), 595-603
1.
Graphs, polymorphisms and the complexity of homomorphism problems, PROCEEDINGS OF THE 40TH ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC'08 (2008), 789-796