Lower Bounds on Representing Boolean Functions as Polynomials in $Z_m $ (Q4875435)
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: Lower Bounds on Representing Boolean Functions as Polynomials in Z_m |
scientific article; zbMATH DE number 869822
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower Bounds on Representing Boolean Functions as Polynomials in $Z_m $ |
scientific article; zbMATH DE number 869822 |
Statements
Lower Bounds on Representing Boolean Functions as Polynomials in $Z_m $ (English)
0 references
2 July 1996
0 references
boolean function complexity
0 references
circuit complexity
0 references
computational complexity
0 references
0.911210000514984
0 references
0.8708713054656982
0 references
