Three definitions of bounded complexity for fuzzy Boolean functions—holographic sampling, polynomial structure, and neural network approximation—are equivalent up to parameter changes.
Tao,A variant of the hypergraph removal lemma, J
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Holographic functions and neural networks
Three definitions of bounded complexity for fuzzy Boolean functions—holographic sampling, polynomial structure, and neural network approximation—are equivalent up to parameter changes.