On the bottleneck counting argument
From MaRDI portal
Publication:1566741
DOI10.1016/S0304-3975(99)00321-7zbMath0943.68071MaRDI QIDQ1566741
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
computational complexity; circuit complexity; monotone circuit complexity; bottleneck counting argument
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
Cites Work