Randomness buys depth for approximate counting (Q483707): 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/s00037-013-0076-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2046927500 / rank
 
Normal rank
Property / cites work
 
Property / cites work: BQP and the polynomial hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\Sigma_ 1^ 1\)-formulae on finite structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4287354 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomized graph products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the Size of Small Depth Circuits for Approximating Majority / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximate majority and probabilistic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient approximation of product distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of promise problems with applications to public-key cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3585016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandomness for network algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues and expansion of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: BPP and the polynomial hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved pseudorandom generators for combinatorial rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom generators for space-bounded computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness is linear in space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-size constant-depth polylog-threshold circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness Amplification Proofs Require Majority / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of constructing pseudorandom generators from hard functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Approximation Algorithms for # P / rank
 
Normal rank

Latest revision as of 10:49, 9 July 2024

scientific article
Language Label Description Also known as
English
Randomness buys depth for approximate counting
scientific article

    Statements

    Randomness buys depth for approximate counting (English)
    0 references
    0 references
    17 December 2014
    0 references
    small-depth circuits
    0 references
    approximate majority
    0 references
    randomness
    0 references
    combinatorial rectangle pseudorandom generator
    0 references

    Identifiers