Extractors and Rank Extractors for Polynomial Sources

In this paper we construct explicit deterministic extractors from polynomial sources, namely from distributions sampled by low degree multivariate polynomials over finite fields. This naturally generalizes previous work on extraction from affine sources. A direct consequence is a deterministic extractor for distributions sampled by polynomial size arithmetic circuits over exponentially large fields. The first step towards extraction is a construction o/rank extractors, which are polynomial mappings that "extract" the algebraic rank from any system of low degree polynomials. More precisely, for any n polynomials, k of which are algebraically independent, a rank extractor outputs k algebraically independent polynomials of slightly higher degree. A result of Wooley allows us to relate algebraic rank and min-entropy and to show that a rank extractor is also a high quality condenser for polynomial sources over polynomially large fields. Finally, to turn this condenser into an extractor, we employ a theorem of Bombieri, giving a character sum estimate for polynomials defined over curves. It allows extracting all the randomness (up to a multiplicative constant) from polynomial sources over exponentially large fields.

[1]  Rajeev Motwani,et al.  Towards a syntactic characterization of PTAS , 1996, STOC '96.

[2]  Philip N. Klein,et al.  A linear-time approximation scheme for planar weighted TSP , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[3]  Dániel Marx,et al.  The closest substring problem with small distances , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[4]  E. J. V. Leeuwen.  Better Approximation Schemes for Disk Graphs , 2006, SWAT.

[5]  Irit Dinur,et al.  The PCP theorem by gap amplification , 2006, STOC.

[6]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998, JACM.

[7]  Joe W. Harris,et al.  Algebraic Geometry: A First Course , 1995 .

[8]  Manuel Blum.  Independent unbiased coin flips from a correlated biased source—A finite state markov chain , 1986, Comb..

[9]  Dániel Marx,et al.  Efficient Approximation Schemes for Geometric Problems? , 2005, ESA.

[10]  Jacob T. Schwartz,et al.  Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.

[11]  Avi Wigderson,et al.  2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction , 2006, STOC '06.

[12]  Rodney G. Downey,et al.  Parameterized complexity for the skeptic , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[13]  D. W. Wang,et al.  A Study on Two Geometric Location Problems , 1988, Information Processing Letters.

[14]  David A. Cox,et al.  Ideals, Varieties, and Algorithms , 1997 .

[15]  Jean Bourgain,et al.  On the Construction of Affine Extractors , 2007 .

[16]  Ronen Shaltiel,et al.  Recent Developments in Explicit Constructions of Extractors , 2002, Bull. EATCS.

[17]  Oded Goldreich,et al.  The Bit Extraction Problem of t-Resilient Functions (Preliminary Version) , 1985, FOCS.

[18]  F. R. Gantmakher.  The Theory of Matrices , 1984 .

[19]  Robert E. Tarjan,et al.  Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[20]  Ran Raz,et al.  Deterministic extractors for bit-fixing sources by obtaining an independent seed , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[21]  Guy Kindler,et al.  Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors , 2005, STOC '05.

[22]  Subhash Suri,et al.  Label placement by maximum independent set in rectangles , 1998, CCCG.

[23]  Umesh V. Vazirani,et al.  Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources , 1987, Comb..

[24]  Harry B. Hunt,et al.  NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs , 1998, J. Algorithms.

[25]  Christos H. Papadimitriou,et al.  An approximation scheme for planar graph TSP , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[26]  Gian-Carlo Rota,et al.  Apolarity and Canonical Forms for Homogeneous Polynomials , 1993, Eur. J. Comb..

[27]  Trevor D. Wooley,et al.  A note on simultaneous congruences , 1996 .

[28]  M. S. L’vov,et al.  Calculation of invariants of programs interpreted over an integrality domain , 1984, Cybernetics.

[29]  Anup Rao,et al.  An Exposition of Bourgain's 2-Source Extractor , 2007, Electron. Colloquium Comput. Complex..

[30]  Ran Raz,et al.  Extractors with weak random seeds , 2005, STOC '05.

[31]  Jirí Fiala,et al.  Geometric separation and exact solutions for the parameterized independent set problem on disk graphs , 2002, J. Algorithms.

[32]  L. Mirsky,et al.  The Theory of Matrices , 1961, The Mathematical Gazette.

[33]  Amnon Ta-Shma,et al.  Extractor codes , 2001, IEEE Transactions on Information Theory.

[34]  Luca Trevisan,et al.  Extracting randomness from samplable distributions , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[35]  Richard Zippel,et al.  Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.

[36]  Alexandr Andoni,et al.  On the Optimality of the Dimensionality Reduction Method , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[37]  Piotr Indyk,et al.  Uncertainty principles, extractors, and explicit embeddings of l2 into l1 , 2007, STOC '07.

[38]  Ge Xia,et al.  Linear FPT reductions and computational lower bounds , 2004, STOC '04.

[39]  Luca Trevisan,et al.  The Approximability of Constraint Satisfaction Problems , 2001, SIAM J. Comput..

[40]  Rolf Niedermeier,et al.  Parameterized complexity: exponential speed-up for planar graph problems , 2004, J. Algorithms.

[41]  Ran Raz,et al.  Error reduction for extractors , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[42]  Russell Impagliazzo,et al.  Which Problems Have Strongly Exponential Complexity? , 2001, J. Comput. Syst. Sci..

[43]  Avi Wigderson,et al.  Extracting Randomness Using Few Independent Sources , 2006, SIAM J. Comput..

[44]  Avi Wigderson,et al.  Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications , 1999, Comb..

[45]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[46]  David Zuckerman,et al.  Deterministic extractors for bit-fixing sources and exposure-resilient cryptography , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[47]  Luca Trevisan,et al.  On the Efficiency of Polynomial Time Approximation Schemes , 1997, Inf. Process. Lett..

[48]  H. P. Robertson.  The Uncertainty Principle , 1929 .

[49]  I. Shafarevich.  Basic algebraic geometry , 1974 .

[50]  Neeraj Kayal.  The Complexity of the Annihilating Polynomial , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.

[51]  Anup Rao,et al.  Extractors for a constant number of polynomially small min-entropy independent sources , 2006, STOC '06.

[52]  Enrico Bombieri,et al.  On Exponential Sums in Finite Fields , 1966 .

[53]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean TSP and other geometric problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[54]  Ran Raz,et al.  Deterministic extractors for affine sources over large fields , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[55]  Oded Goldreich,et al.  Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity , 1988, SIAM J. Comput..

[56]  Noam Nisan,et al.  More deterministic simulation in logspace , 1993, STOC.

[57]  Rudolf Lide,et al.  Finite fields , 1983 .

[58]  Brenda S. Baker,et al.  Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).