The following publications are possibly variants of this publication:
- Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower BoundsDan Gutfreund, Akinori Kawachi. coco 2010: 38-49 [doi]
- Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower BoundsDan Gutfreund, Akinori Kawachi. eccc, 16:146, 2009. [doi]
- A note on exponential circuit lower bounds from derandomizing Arthur-Merlin gamesScott Aaronson, Baris Aydinlioglu, Harry Buhrman, John M. Hitchcock, Dieter van Melkebeek. eccc, 17:174, 2010. [doi]
- Nondeterministic Circuit Lower Bounds from Mildly Derandomizing Arthur-Merlin GamesBaris Aydinlioglu, Dieter van Melkebeek. eccc, 19:80, 2012. [doi]
- Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin gamesBaris Aydinlioglu, Dieter van Melkebeek. cc, 26(1):79-118, 2017. [doi]
- Nondeterministic Circuit Lower Bounds from Mildly De-randomizing Arthur-Merlin GamesBaris Aydinlioglu, Dieter van Melkebeek. coco 2012: 269-279 [doi]