The Two Queries Assumption and Arthur-Merlin Classes

DOI10.1007/978-3-662-44465-8_51zbMath1409.68124OpenAlexW305877291MaRDI QIDQ2922647

Vyas Ram Selvam

Publication date: 14 October 2014

Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44465-8_51

zbMATH Keywords

computational complexityArthur-Merlin classesSAT oracletwo-queries assumption

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)