Amplification and Derandomization without Slowdown (Q5129234): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1509.08123 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Diophantine Equations Over Polynomials and Soft Decoding of Reed–Solomon Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random sampling and approximation of MAX-CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Algorithmic Aspects of the Regularity Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Constructions of Almost k-wise Independent Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Addendum to “simple constructions of almost k-wise independent random variables” / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Generators for Regular Branching Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: MAX-CUT has a randomized approximation scheme in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Deterministic Algorithm for the Frieze–Kannan Regularity Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for Finding Frieze–Kannan Regular Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3046711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient learning algorithms yield circuit lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Regularity Lemmas and their Algorithmic Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast new algorithm for weak graph regularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sample of Samplers: A Computational Perspective on Sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property testing and its connection to learning and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNF sparsification and a faster deterministic counting algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved decoding of Reed-Solomon and algebraic-geometry codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandomness from Shrinkage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing the seed length in the Nisan-Wigderson generator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a set of almost deterministic k-independent random variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized linear-time algorithm to find minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On construction of \(k\)-wise independent random variables / 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: Q3093197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Dense Max 2-CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579443 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Generators for Polynomial Threshold Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small-Bias Probability Spaces: Efficient Constructions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal minimum spanning tree algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak derandomization of weak algorithms: explicit versions of Yao's lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3281059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding of Reed Solomon codes beyond the error-correction bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom generators without the XOR lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sum of \(D\) small-bias generators fools polynomials of degree \(D\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exposure-resilient extractors and the derandomization of probabilistic sublinear time / rank
 
Normal rank

Revision as of 22:58, 23 July 2024

scientific article; zbMATH DE number 7266065
Language Label Description Also known as
English
Amplification and Derandomization without Slowdown
scientific article; zbMATH DE number 7266065

    Statements

    Amplification and Derandomization without Slowdown (English)
    0 references
    0 references
    0 references
    0 references
    26 October 2020
    0 references
    0 references
    derandomization
    0 references
    amplification
    0 references
    sketching
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references