The composition complexity of majority

DOI10.4230/LIPICS.CCC.2022.19MaRDI QIDQ6568361zbMATH OpenFDO

Authors Victor Lecomte, Prasanna Ramakrishnan, Li-Yang Tan

Publication date 5 July 2024

Full work available at URL https://doi.org/10.4230/LIPICS.CCC.2022.19

zbMATH Keywords

circuit lower boundscomputational complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited in

(2)

• Local enumeration and majority lower bounds
• Local enumeration: the not-all-equal case

This page was built for publication: The composition complexity of majority

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