Theory and Applications of Models of Computation

DOI10.1007/11750321zbMath1178.68274OpenAlexW4296156427MaRDI QIDQ5898860

A. Pavan, Liyu Zhang, Christian Glaßer, Selman, Alan L.

Publication date: 30 April 2007

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

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

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

Polynomial-time axioms of choice and polynomial-time cardinality

This page was built for publication: Theory and Applications of Models of Computation