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

Brunar Johanna, Marcin Kozik, Tomáš Nagy, Michael Pinsker, The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems, IEEE Symposium on Logic in Computer Science [LICS], (2025),
Demian Banakh, Ciardo Lorenzo, Marcin Kozik, Jan Tułowiecki, Classical simulation of quantum CSP strategies, IEEE Symposium on Logic in Computer Science [LICS], (2025), 372-388
Libor Barto, Zarathustra Brady, Andrei Bulatov, Marcin Kozik, Dmitriy Zhuk, Unifying the three algebraic approaches to the CSP via minimal Taylor algebras, Theoretics 3 (2024),
Ciardo Lorenzo, Marcin Kozik, Andrei Krokhin, Vesa Nakajima Tamio, Zivny Stanislav, 1-in-3 vs. Not-All-Equal: Dichotomy of a broken promise, IEEE Symposium on Logic in Computer Science [LICS], (2024), Article No.: 24, Pages 1 - 12
Demian Banakh, Marcin Kozik, Injective hardness condition for PCSPs, IEEE Symposium on Logic in Computer Science [LICS], (2024), article number 8

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