Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions (Q657913)
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: Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions |
scientific article; zbMATH DE number 5996365
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions |
scientific article; zbMATH DE number 5996365 |
Statements
Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions (English)
0 references
11 January 2012
0 references
\(k\)-bounded function
0 references
pseudo-Boolean function
0 references
Fourier coefficients
0 references
randomized algorithm
0 references
Walsh analysis
0 references
graph finding
0 references
learning polynomials
0 references
linkage discovery
0 references
0 references
0 references
0.7768499255180359
0 references
0.7703671455383301
0 references
0.7662751078605652
0 references
0.7594996690750122
0 references
0.7589273452758789
0 references
