scientific article; zbMATH DE number 1301088

MaRDI QIDQ4246733zbMATHFDO

Authors Richard Beigel, Jun Tarui, Seinosuke Toda

Publication date 15 June 1999

Mathematics Subject Classification ID

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

Cited in

(6)

• Uniform proofs of ACC representations
• Depth Reduction for Circuits with a Single Layer of Modular Counting Gates
• Weights of exact threshold functions
• NEXP does not have non-uniform quasipolynomial-size ACC circuits of \(o(\log \log n)\) depth
• Lower bounds against sparse symmetric functions of ACC circuits: expanding the reach of \#SAT algorithms
• Circuit complexity before the dawn of the new millennium

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4246733)