An upper bound on the number of relevant variables for Boolean functions on the Hamming graph (Q6530769)
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: An upper bound on the number of relevant variables for Boolean functions on the Hamming graph |
scientific article from arXiv
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An upper bound on the number of relevant variables for Boolean functions on the Hamming graph |
scientific article from arXiv |
Statements
An upper bound on the number of relevant variables for Boolean functions on the Hamming graph (English)
0 references
