Gutfreund, D., & Kawachi, A. (2010, June). Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds. 2010 IEEE 25th Annual Conference on Computational Complexity, 38-49. https://doi.org/10.1109/CCC.2010.13
Citace podle Chicago (17th ed.)Gutfreund, Dan, a Akinori Kawachi. "Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds." 2010 IEEE 25th Annual Conference on Computational Complexity Jun. 2010: 38-49. https://doi.org/10.1109/CCC.2010.13.
Citace podle MLA (9th ed.)Gutfreund, Dan, a Akinori Kawachi. "Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds." 2010 IEEE 25th Annual Conference on Computational Complexity, Jun. 2010, pp. 38-49, https://doi.org/10.1109/CCC.2010.13.