On the bottleneck counting argument (Q1566741): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The monotone circuit complexity of Boolean functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4726174 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Symmetric approximation arguments for monotone lower bounds without sunflowers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4234106 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The intractability of resolution / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4231908 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3758729 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3762226 / rank | |||
Normal rank | |||
Revision as of 15:34, 29 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the bottleneck counting argument |
scientific article |
Statements
On the bottleneck counting argument (English)
0 references
4 June 2000
0 references
computational complexity
0 references
circuit complexity
0 references
monotone circuit complexity
0 references
bottleneck counting argument
0 references
