Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity (Q3088135): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-22935-0_56 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4241868777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noise sensitivity of Boolean functions and applications to percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for Testing Juntas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing juntas nearly optimally / 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: Bounding the average sensitivity and noise sensitivity of polynomial threshold functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The importance of being biased / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing juntas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every monotone graph property has a sharp threshold / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3597148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4798347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fourier-theoretic perspective on the Condorcet paradox and Arrow's theorem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Social Indeterminacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of unique 2-prover 1-round games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sharp Threshold for Network Reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatization of the Banzhaf value / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant depth circuits, Fourier transform, and learnability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing ±1-weight halfspace / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Monotone Decision Trees in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Influence of Monotone Boolean Functions in O(√n) Query Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Computability by Width Two OBDDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the critical percolation probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Russo's approximate zero-one law / rank
 
Normal rank

Latest revision as of 10:19, 4 July 2024

scientific article
Language Label Description Also known as
English
Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity
scientific article

    Statements

    Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 August 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references