Depth-reduction for composites

DOI10.1109/FOCS.2016.20MaRDI QIDQ6946490zbMATH OpenFDO

Authors Periklis A. Papakonstantinou, Shiteng Chen

Publication date 6 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2016.20

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cited in

(1)

• Nondeterministic quasi-polynomial time is average-case hard for \textsf{ACC} circuits

This page was built for publication: Depth-reduction for composites

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