Mathematical Foundations of Computer Science 2005
From MaRDI portal
Publication:5492848
DOI10.1007/11549345zbMath1156.68396MaRDI QIDQ5492848
Heribert Vollmer, Henning Schnoor, Neil Immerman, Michael Bauland, 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
68Q25: Analysis of algorithms and problem complexity
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
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, 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, The complexity of problems for quantified constraints, Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint