The monotone circuit complexity of quadratic Boolean functions (Q2509028)
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 monotone circuit complexity of quadratic Boolean functions |
scientific article; zbMATH DE number 5064669
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The monotone circuit complexity of quadratic Boolean functions |
scientific article; zbMATH DE number 5064669 |
Statements
The monotone circuit complexity of quadratic Boolean functions (English)
0 references
16 October 2006
0 references
single level conjunctive complexity
0 references
quadratic functions
0 references
0.9971944689750672
0 references
0.93396657705307
0 references
0.8732847571372986
0 references
