Publication:4501551
From MaRDI portal
zbMath0962.68071MaRDI QIDQ4501551
Harry Buhrman, Dieter van Melkebeek, Steve Fenner, Lance J. Fortnow
Publication date: 4 September 2000
03D15: Complexity of computation (including implicit computational complexity)
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
03F20: Complexity of proofs
Related Items
NEW RELATIONS AND SEPARATIONS OF CONJECTURES ABOUT INCOMPLETENESS IN THE FINITE DOMAIN, Towards NP-P via proof complexity and search, Optimal proof systems imply complete sets for promise classes, Error-bounded probabilistic computations between MA and AM