On the bottleneck counting argument
type: Item
instance of: scholarly article
title: On the bottleneck counting argument
zbMATH Open document ID: 0943.68071
DOI: 10.1016/S0304-3975(99)00321-7
author: Janos Simon
author: Shi-Chun Tsai
published in: Theoretical Computer Science
publication date: 2000-06-04T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1454573
zbMATH Keywords: computational complexity
zbMATH Keywords: circuit complexity
zbMATH Keywords: monotone circuit complexity
zbMATH Keywords: bottleneck counting argument
MaRDI profile type: Publication
cites work: The monotone circuit complexity of Boolean functions
cites work: Q4726174
cites work: Symmetric approximation arguments for monotone lower bounds without sunflowers
cites work: Q4234106
cites work: The intractability of resolution
cites work: Q4231908
cites work: Q3758729
cites work: Q3762226
full work available at URL: s0304-3975(99)00321-7
OpenAlex ID: W2027898675
description: scientific article; zbMATH DE number 1454573