From Complexity to Algebra and Back: Digraph Classes, Collapsibility, and the PGP

DOI10.1109/LICS.2015.50zbMath1401.68115arXiv1501.04558OpenAlexW1497273694MaRDI QIDQ4635827

No author found.

Publication date: 23 April 2018

Published in: 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1501.04558

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of universal algebra in computer science (08A70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Operations and polynomials in algebraic structures, primal algebras (08A40) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

Quantified Constraint Satisfaction Problem on Semicomplete Digraphs ⋮ Quantified Constraints in Twenty Seventeen ⋮ The size of generating sets of powers ⋮ The Complexity of Quantified Constraints Using the Algebraic Formulation ⋮ The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation

This page was built for publication: From Complexity to Algebra and Back: Digraph Classes, Collapsibility, and the PGP