Scott Diehl. Lower Bounds for Swapping Arthur and Merlin. In Moses Charikar, Klaus Jansen, Omer Reingold, José D. P. Rolim, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings. Volume 4627 of Lecture Notes in Computer Science, pages 449-463, Springer, 2007. [doi]
@inproceedings{Diehl07,
title = {Lower Bounds for Swapping Arthur and Merlin},
author = {Scott Diehl},
year = {2007},
doi = {10.1007/978-3-540-74208-1_33},
url = {http://dx.doi.org/10.1007/978-3-540-74208-1_33},
researchr = {https://researchr.org/publication/Diehl07},
cites = {0},
citedby = {0},
pages = {449-463},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings},
editor = {Moses Charikar and Klaus Jansen and Omer Reingold and José D. P. Rolim},
volume = {4627},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-74207-4},
}