Complexity of Boolean functions over bases with unbounded fan-in gates (Q1350754)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 984141
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of Boolean functions over bases with unbounded fan-in gates |
scientific article; zbMATH DE number 984141 |
Statements
Complexity of Boolean functions over bases with unbounded fan-in gates (English)
0 references
27 February 1997
0 references
Boolean functions
0 references
Computational complexity
0 references
0.8655586242675781
0 references
0.8431373238563538
0 references
0.8390082120895386
0 references
0.8383580446243286
0 references
0.8371695280075073
0 references
