Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower BoundsB. Aydinliog̃luDan Gutfreundet al.2011Computational ComplexityPaper
Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower boundsDan GutfreundAkinori Kawachi2010CCC 2010Conference paper
Improved algorithms for quantum identification of Boolean oraclesAndris AmbainisKazuo Iwamaet al.2007Theoretical Computer SciencePaper