The conjunctive complexity of quadratic Boolean functions (Q808253)
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: The conjunctive complexity of quadratic Boolean functions |
scientific article; zbMATH DE number 4209598
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The conjunctive complexity of quadratic Boolean functions |
scientific article; zbMATH DE number 4209598 |
Statements
The conjunctive complexity of quadratic Boolean functions (English)
0 references
1991
0 references
circuit complexity
0 references
monotone circuits
0 references
quadratic Boolean functions
0 references
single level complexity
0 references
NP complete
0 references
conjunctive complexity
0 references
0 references
0.939746916294098
0 references
0.93396657705307
0 references
0.870046079158783
0 references
0.8182132840156555
0 references
