Nondeterministic Circuit Lower Bounds from Mildly De-randomizing Arthur-Merlin Games

Baris Aydinlioglu, Dieter van Melkebeek. Nondeterministic Circuit Lower Bounds from Mildly De-randomizing Arthur-Merlin Games. In Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012. pages 269-279, IEEE, 2012. [doi]

Authors

Baris Aydinlioglu

This author has not been identified. Look up 'Baris Aydinlioglu' in Google

Dieter van Melkebeek

This author has not been identified. Look up 'Dieter van Melkebeek' in Google