A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log <i>n</i> Negation Gates (Q5700577)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log n Negation Gates |
scientific article; zbMATH DE number 2220467
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log <i>n</i> Negation Gates |
scientific article; zbMATH DE number 2220467 |
Statements
A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log <i>n</i> Negation Gates (English)
0 references
28 October 2005
0 references
circuit complexity
0 references
monotone circuit
0 references
negation-limited circuit
0 references
approximation method
0 references
lower bound
0 references
clique function
0 references
0.9812321066856384
0 references
0.8331606984138489
0 references
0.8257328271865845
0 references
0.8179715275764465
0 references
