Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345zbMath1156.68396OpenAlexW2494705596MaRDI QIDQ5492848

Heribert Vollmer, Henning Schnoor, Michael Bauland, Neil Immerman, Eric W. Allender

Publication date: 20 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11549345

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items

Zeons, orthozeons, and graph colorings ⋮ Strong partial clones and the time complexity of SAT problems ⋮ Complexity Classifications for Logic-Based Argumentation ⋮ On the complexity of \(\mathbb{H}\)-coloring for special oriented trees ⋮ The complexity of problems for quantified constraints ⋮ Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint ⋮ On the expression complexity of equivalence and isomorphism of primitive positive formulas ⋮ Universal algebra and hardness results for constraint satisfaction problems ⋮ The complexity of satisfiability problems: Refining Schaefer's theorem ⋮ Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? ⋮ Recent Results on the Algebraic Approach to the CSP ⋮ Partial Polymorphisms and Constraint Satisfaction Problems