A better-than-3(n) Depth lower bound for De Morgan formulas with restrictions on top gates

DOI10.4230/LIPICS.CCC.2022.13MaRDI QIDQ6568352FDOQ6568352

Authors: Ivan Mihajlin, Anastasia Sofronova 

Publication date: 5 July 2024

zbMATH Keywords

communication complexityDe Morgan formulasformula complexityKarchmer-Raz-Wigderson conjecture

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

This page was built for publication: A better-than-\(3\log(n)\) Depth lower bound for De Morgan formulas with restrictions on top gates

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