Range avoidance for constant depth circuits: hardness and algorithms

DOI10.4230/LIPICS.APPROX/RANDOM.2023.65MaRDI QIDQ6663090zbMATH OpenFDO

Authors Karthik Gajulapalli, Alexander Golovnev, Satyajeet Nagargoje, Sidhant Saraogi

Publication date 14 January 2025

Full work available at URL https://doi.org/10.4230/LIPICS.APPROX/RANDOM.2023.65

zbMATH Keywords

explicit constructionsmatrix rigiditycircuit lower boundsBoolean function analysislow-depth circuitsrange avoidance

Mathematics Subject Classification ID

Randomized algorithms (68W20) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cited in

(3)

• Symmetric exponential time requires near-maximum circuit size
• Oblivious complexity classes revisited: lower bounds and hierarchies
• Range avoidance for low-depth circuits and connections to pseudorandomness

This page was built for publication: Range avoidance for constant depth circuits: hardness and algorithms

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