Publication:3549623
From MaRDI portal
zbMath1232.68058MaRDI QIDQ3549623
Publication date: 5 January 2009
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds, Robust simulations and significant separations, Efficient learning algorithms yield circuit lower bounds, Circuit Lower Bounds for Average-Case MA