Lower Bounds on Representing Boolean Functions as Polynomials in $Z_m $ (Q4875435): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/s0895480193255505 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2097114401 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:58, 30 July 2024
scientific article; zbMATH DE number 869822
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
