Monotone circuit lower bounds from robust sunflowers
From MaRDI portal
Publication:5970784
DOI10.1007/s00453-022-01000-3MaRDI QIDQ5970784
Mrinal Kumar, Benjamin Rossman, Bruno Pasqualotto Cavalar
Publication date: 8 December 2022
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-022-01000-3
computational complexity; extremal combinatorics; circuit complexity; monotone arithmetic circuits; monotone circuit complexity; sunflowers; arithmetic circuit complexity; robust sunflower lemma