On the bottleneck counting argument

DOI10.1016/S0304-3975(99)00321-7zbMath0943.68071OpenAlexW2027898675MaRDI QIDQ1566741

Janos Simon, Shi-Chun Tsai

Publication date: 4 June 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00321-7

zbMATH Keywords

computational complexitycircuit complexitymonotone circuit complexitybottleneck counting argument

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

On Negations in Boolean Networks ⋮ Unnamed Item

Cites Work

• The intractability of resolution
• The monotone circuit complexity of Boolean functions
• Symmetric approximation arguments for monotone lower bounds without sunflowers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the bottleneck counting argument