Negation is Powerless for Boolean Slice Functions (Q4726175)
From MaRDI portal
!
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 3999838
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Negation is Powerless for Boolean Slice Functions |
scientific article; zbMATH DE number 3999838 |
Statements
Negation is Powerless for Boolean Slice Functions (English)
0 references
1986
0 references
circuit complexity
0 references
upper bounds
0 references
complexity of minimal size Boolean circuits
0 references
monotone circuit
0 references
slice function
0 references
Boolean function
0 references
0.8998103737831116
0 references
0.8672813773155212
0 references
0.8599035143852234
0 references
0.8449192047119141
0 references
