scientific article; zbMATH DE number 1500532

zbMath0962.68071MaRDI QIDQ4501551

Harry Buhrman, Dieter van Melkebeek, Steve Fenner, Lance J. Fortnow

Publication date: 4 September 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

proof complexitycomplexity class separation

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of proofs (03F20)

Related Items

NEW RELATIONS AND SEPARATIONS OF CONJECTURES ABOUT INCOMPLETENESS IN THE FINITE DOMAIN, Optimal proof systems imply complete sets for promise classes, Towards NP-P via proof complexity and search, Error-bounded probabilistic computations between MA and AM