 | 2012 |
|---|
| 11 |       | Libor Barto,
Marcin Kozik:
Robust satisfiability of constraint satisfaction problems.
STOC 2012: 931-940 |
| 10 | | Libor Barto,
Marcin Kozik:
Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem
Logical Methods in Computer Science 8(1): (2012) |
| 2011 |
|---|
| 9 | | Libor Barto,
Marcin Kozik:
Robust Satisfiability of Constraint Satisfaction Problems.
Electronic Colloquium on Computational Complexity (ECCC) 18: 163 (2011) |
| 2010 |
|---|
| 8 | | Libor Barto,
Marcin Kozik:
New Conditions for Taylor Varieties and CSP.
LICS 2010: 100-109 |
| 2009 |
|---|
| 7 | | Libor Barto,
Marcin Kozik:
Constraint Satisfaction Problems of Bounded Width.
FOCS 2009: 595-603 |
| 6 | | Libor Barto,
Marcin Kozik,
Todd Niven:
The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell).
SIAM J. Comput. 38(5): 1782-1802 (2009) |
| 5 | | Marcin Kozik:
A 2EXPTIME Complete Varietal Membership Problem.
SIAM J. Comput. 38(6): 2443-2467 (2009) |
| 4 | | Libor Barto,
Marcin Kozik:
Congruence Distributivity Implies Bounded Width.
SIAM J. Comput. 39(4): 1531-1542 (2009) |
| 2008 |
|---|
| 3 | | Libor Barto,
Marcin Kozik,
Todd Niven:
Graphs, polymorphisms and the complexity of homomorphism problems.
STOC 2008: 789-796 |
| 2 | | Marcin Kozik:
A finite set of functions with an EXPTIME-complete composition problem.
Theor. Comput. Sci. 407(1-3): 330-341 (2008) |
| 2007 |
|---|
| 1 | | Marcin Kozik:
Computationally and Algebraically Complex Finite Algebra Membership Problems.
IJAC 17(8): 1635-1666 (2007) |
Data released under the ODC-BY 1.0 license — See also our legal information page