Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds
- B. Aydinliog̃lu
- Dan Gutfreund
- et al.
- 2011
- Computational Complexity
Paper
Publications
3 results for Akinori Kawachi
Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds
- Dan Gutfreund
- Akinori Kawachi
- 2010
- CCC 2010
Conference paperImproved algorithms for quantum identification of Boolean oracles
- Andris Ambainis
- Kazuo Iwama
- et al.
- 2007
- Theoretical Computer Science
Paper