scientific article; zbMATH DE number 6146452

DOI10.4230/LIPIcs.STACS.2008.1342zbMath1259.68071MaRDI QIDQ4910716

Sambuddha Roy, Venkatesan T. Chakaravarthy

Publication date: 19 March 2013

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_bf73.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Karp-Lipton theoremlearning circuitssymmetric alternationpromise-AM

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (4)

Circuit lower bounds from learning-theoretic approaches ⋮ Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds ⋮ Arthur and Merlin as Oracles ⋮ On the probabilistic closure of the loose unambiguous hierarchy

This page was built for publication: