Nondeterministic Circuit Lower Bounds from Mildly Derandomizing Arthur-Merlin Games

Baris Aydinlioglu, Dieter van Melkebeek. Nondeterministic Circuit Lower Bounds from Mildly Derandomizing Arthur-Merlin Games. Electronic Colloquium on Computational Complexity (ECCC), 19:80, 2012. [doi]

Abstract

Abstract is missing.