Symmetric approximation arguments for monotone lower bounds without sunflowers

DOI10.1007/s000370050017zbMath0942.68058OpenAlexW2030387300MaRDI QIDQ1300606

Staffan Ulfberg, Christer Berg

Publication date: 28 August 2000

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s000370050017

zbMATH Keywords

monotone circuit complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (5)

Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes ⋮ Negation-limited formulas ⋮ On Negations in Boolean Networks ⋮ On the bottleneck counting argument ⋮ Unnamed Item

This page was built for publication: Symmetric approximation arguments for monotone lower bounds without sunflowers