On the modulo degree complexity of Boolean functions (Q5918108): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:06, 1 February 2024
scientific article; zbMATH DE number 7187634
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the modulo degree complexity of Boolean functions |
scientific article; zbMATH DE number 7187634 |
Statements
On the modulo degree complexity of Boolean functions (English)
0 references
7 April 2020
0 references
Boolean function
0 references
degree complexity
0 references
polynomial
0 references
decision tree complexity
0 references
hypergraph property
0 references
