Noisy Interpolating Sets for low degree polynomials

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2008, Pages 140-148

  Dvir, Zeev ^a   Shpilka, Amir ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

INTERPOLATION; MATHEMATICAL TECHNIQUES; POLYNOMIAL APPROXIMATION;

LOW DEGREE;

COMPUTATIONAL COMPLEXITY;

EID: 51749097357     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2008.14     Document Type: Conference Paper

References (14)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. JACM, 45(3):501-555, 1998.
2. S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. JACM, 45(1):70-122, 1998.
3. L. Babai, L. Fortnow, N. Nisan, and A. Wigderson. Bpp has subexponential time simulations unless exptime has publishable proofs. Complexity Theory, 3:307-318, 1993.
4. A. Bogdanov. Pseudorandom generators for low degree polynomials. In Proceedings of the 37th annual STOC, pages 21-30, 2005.
5. A. Bogdanov and E. Viola. Pseudorandom bits for polynomials. In Proceedings of the 48th Annual FOCS, pages 41-51, 2007.
6. W. C. Huffman and R. A. Brualdi. Handbook of Coding Theory. Elsevier Science Inc., New York, NY, USA, 1998.
7. R. Impagliazzo and A. Wigderson. P=BPP unless E has subexponential circuits: derandomizing the xor lemma. In Proceedings of the 29th STOC, pages 220-229, 1997.
8. J. Justesen. A class of constructive asymptotically good algebraic codes. IEEE Transactions on Information Theory, 18:652-656, 1972.
9. S. Lovett. Unconditional pseudorandom generators for low degree polynomials. ECCC Report TR07-075, 2007.
10. F. J. MacWilliams and N. J. A. Sloane. The Theory of Error-Correcting Codes, Part II. North-Holland, 1977.
11. R. Shaltiel and C. Umans. Simple extractors for all minentropies and a new pseudorandom generator. JACM, 52(2):172-216, 2005.
12. M. Sudan, L. Trevisan, and S. Vadhan. Pseudorandom generators without the XOR lemma. J. of Computer and System Sciences, 62, 2001.
13. A. Ta-Shma, D. Zuckerman, and S. Safra. Extractors from Reed-Muller Codes. In 42nd Annual FOCS, pages 638-647, 2001.
14. E. Viola. The sum of d small-bias generators fools polynomials of degree d. CCC'08 (to appear), 2008.