Amanote Research

Amanote Research

    RegisterSign In

Randomness-Efficient Low Degree Tests and Short PCPs via Epsilon-Biased Sets

doi 10.1145/780627.780631
Full Text
Open PDF
Abstract

Available in full text

Date

January 1, 2003

Authors
Eli Ben-SassonMadhu SudanSalil VadhanAvi Wigderson
Publisher

ACM Press


Related search

On the Randomness That Generates Biased Samples: The Limited Randomness Approach

Computer Science and Information Systems
Computer Science
2019English

Combinatorial PCPs With Efficient Verifiers

2009English

New Statistical Randomness Tests: 4-Bit Template Matching Tests

Turkish Journal of Mathematics
Mathematics
2017English

Some Tests of Randomness With Applications

1981English

Small PCPs With Low Query Complexity

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2000English

Short Cycles via Low-Diameter Decompositions

2019English

Efficient Batch Zero-Knowledge Arguments for Low Degree Polynomials

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Jump Inversions Inside Effectively Closed Sets and Applications to Randomness

Journal of Symbolic Logic
PhilosophyLogic
2011English

Resource-Efficient Common Randomness and Secret-Key Schemes

2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy