Lower Bounds for Swapping Arthur and Merlin

DOI10.1007/978-3-540-74208-1_33zbMath1171.68487OpenAlexW111399865MaRDI QIDQ3603486

Scott Diehl

Publication date: 17 February 2009

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74208-1_33

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Unnamed Item

This page was built for publication: Lower Bounds for Swapping Arthur and Merlin