On the modulo degree complexity of Boolean functions (Q5918108): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2018.04.049 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2018.04.049 / rank | |||
Normal rank | |||
Latest revision as of 16:30, 16 December 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
0 references
0 references
0 references
