Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions (Q657913)

From MaRDI portal
Revision as of 20:26, 4 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    11 January 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    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