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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning a Hidden Subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning a Hidden Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3174038 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: More efficient PAC-learning of DNF with membership queries under the uniform distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Fourier spectrum of monotone functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal query complexity bounds for finding graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3174124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal reconstruction of graphs under the additive model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Decision Trees Using the Fourier Spectrum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4839061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the degree of Boolean functions as real polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning and Verifying Graphs Using Queries with a Focus on Edge Counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities / rank
 
Normal rank

Latest revision as of 20:26, 4 July 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
    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