Monotone circuit lower bounds from robust sunflowers

DOI10.1007/978-3-030-61792-9_25OpenAlexW3115339655MaRDI QIDQ5918506

Bruno Pasqualotto Cavalar, Benjamin Rossman, Mrinal Kumar

Publication date: 13 October 2022

Published in: LATIN 2020: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.03883

Mathematics Subject Classification ID

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

Related Items (2)

Monotone arithmetic complexity of graph homomorphism polynomials ⋮ Improved bounds for the sunflower lemma

This page was built for publication: Monotone circuit lower bounds from robust sunflowers