The gap between monotone and non-monotone circuit complexity is exponential (Q1813126): 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: The ellipsoid method and its consequences in combinatorial optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3050157 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Shannon capacity of a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3758729 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Lower bounds on monotone complexity of the logical permanent / rank | |||
Normal rank | |||
Latest revision as of 15:57, 14 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The gap between monotone and non-monotone circuit complexity is exponential |
scientific article |
Statements
The gap between monotone and non-monotone circuit complexity is exponential (English)
0 references
25 June 1992
0 references
A. A. Razborov has shown that there exists a polynomial time computable monotone Boolean function whose monotone circuit complexity is at least \(n^{c\log n}\). We observe that this lower bound can be improved to \(\exp(cn^{1/6-o(1)})\). The proof is immediate by combining the Alon- Boppana version of another argument of Razborov with results of Grötschel-Lovász-Schrijver on the Lovász-capacity \(\delta\) of a graph.
0 references
