Schaefer's theorem for graphs

DOI10.1145/1993636.1993724MaRDI QIDQ6828744zbMATH OpenFDO

Authors Manuel Bodirsky, Michael Pinsker

Publication date 5 June 2014

Published in Proceedings of the forty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1993636.1993724

zbMATH Keywords

complexity dichotomyconstraint satisfaction problemspolymorphismsramsey theoryuniversal algebra

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

This page was built for publication: Schaefer's theorem for graphs

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