Top-down lower bounds for depth-four circuits

DOI10.1109/FOCS57990.2023.00063MaRDI QIDQ6942908zbMATH OpenFDO

Authors Artur Riazanov, Mika Göös, Dmitry Sokolov, Anastasia Sofronova

Publication date 15 August 2025

Full work available at URL https://doi.org/10.1109/FOCS57990.2023.00063

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(3)

• A nearly-4 n depth lower bound for formulas with restriction on top
• Reconstructing sets of strings from their k-way projections: algorithms \& complexity (extended abstract)
• Generalised linial-nisan conjecture is false for DNFs

This page was built for publication: Top-down lower bounds for depth-four circuits

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