Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions (Q657913): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:53, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions |
scientific article |
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
