Libor Barto, Zarathustra Brady, Andrei Bulatov, Marcin Kozik, Dmitriy Zhuk, Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP, IEEE Symposium on Logic in Computer Science [LICS] 1 (2021), 1-13
Libor Barto, Marcin Kozik, Constraint Satisfaction Problems Solvable by Local Consistency Methods, Journal of the ACM 61 (2014), article no. 3
Libor Barto, Marcin Kozik, New conditions for Taylor varieties and CSP, Proceedings of the 25th Ieee/acm Symposium On Logic in Computer Science Lics'10 (2010), 100-109

Marcin Kozik, Libor Barto, Michael Pinsker, Bertalan Bodor, Antoine Mottet, Symmetries of Graphs and Structures that Fail to Interpret a Finite Thing, IEEE Symposium on Logic in Computer Science [LICS] brak (2023), 1-13
Libor Barto, Marcin Kozik, Combinatorial Gap Theorem and Reductions between Promise CSPs, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2022), pp.1204 - 1220
Libor Barto, Zarathustra Brady, Andrei Bulatov, Marcin Kozik, Dmitriy Zhuk, Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP, IEEE Symposium on Logic in Computer Science [LICS] 1 (2021), 1-13
Marcin Kozik, Solving CSPs using weak local consistency, SIAM Journal on Computing 50(4) (2021), 1263-1286
Libor Barto, Tan Johnson, Marcin Kozik, Matthew Valeriote, Sensitive Instances of the Constraint Satisfaction Problem, International Colloquium on Automata Languages and Programming [ICALP](MAIN), (2020), 110:1-110:18

I work in computational complexity of Constraint Satisfaction Problems with special emphasis on the universal algebraic tools.

Marcin Kozik

academic degree/title Doctor of Science position

research and faculty staff member group, university professor

unit

ORCID

contact

marcin.kozik@uj.edu.pl

Faculty of Mathematics and Computer Science