scientific article; zbMATH DE number 1500525
From MaRDI portal
Publication:4501542
zbMath0962.68154MaRDI QIDQ4501542
Martin Mundhenk, V. Arvind, Jacobo Toran, Johannes Köbler
Publication date: 4 September 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of proofs (03F20)
Related Items