The CSP Dichotomy, the Axiom of Choice, and Cyclic Polymorphisms

arXiv2310.00514MaRDI QIDQ6453288FDOQ6453288

Authors: Tamás Kátay, László Márton Tóth, Zoltán Vidnyánszky 

Publication date: 30 September 2023

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Axiom of choice and related propositions (03E25)

This page was built for publication: The CSP Dichotomy, the Axiom of Choice, and Cyclic Polymorphisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6453288)