Mathematical Foundations of Computer Science 2005
From MaRDI portal
Publication:5492852
DOI10.1007/11549345zbMath1156.68397OpenAlexW2494705596MaRDI QIDQ5492852
Michael Bauland, Edith Hemaspaandra
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
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint ⋮ Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?