More on Average Case vs Approximation Complexity

AbstractWe consider the problem to determine the maximal number of satisfiable equations in a linear system chosen at random. We make several plausible conjectures about the average case hardness of this problem for some natural distributions on the instances, and relate them to several interesting questions in the theory of approximation algorithms and in cryptography. Namely we show that our conjectures imply the following facts: ◦ Feige’s hypothesis about the hardness of refuting a random 3CNF is true, which in turn implies inapproximability within a constant for several combinatorial problems, for which no NP-hardness of approximation is known. ◦ It is hard to approximate the NEAREST CODEWORD within factor n1-ε. ◦ It is hard to estimate the rigidity of a matrix. More exactly, it is hard to distinguish between matrices of low rigidity and random ones. ◦ There exists a secure public-key (probabilistic) cryptosystem, based on the intractability of decoding of random binary codes.

[1]  Vitaly Feldman.  Attribute-Efficient and Non-adaptive Learning of Parities and DNF Expressions , 2007, J. Mach. Learn. Res..

[2]  Robert J. McEliece,et al.  A public key cryptosystem based on algebraic coding theory , 1978 .

[3]  Igor Pak,et al.  On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes , 2001, Discret. Appl. Math..

[4]  Michael Alekhnovich,et al.  Pseudorandom Generators in Propositional Proof Complexity , 2004, SIAM J. Comput..

[5]  Moni Naor,et al.  Small-bias probability spaces: efficient constructions and applications , 1990, STOC '90.

[6]  Uriel Feige,et al.  Resolution lower bounds for the weak pigeon hole principle , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[7]  Jeffrey C. Lagarias,et al.  Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice , 1990, Comb..

[8]  Sanjeev Arora,et al.  Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.

[9]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[10]  Daniel A. Spielman,et al.  A Remark on Matrix Rigidity , 1997, Inf. Process. Lett..

[11]  G. S. Tseitin.  On the Complexity of Derivation in Propositional Calculus , 1983 .

[12]  Eli Ben-Sasson,et al.  Some 3CNF properties are hard to test , 2003, STOC '03.

[13]  Dieter Gollmann,et al.  Clock-controlled shift registers: a review , 1989, IEEE J. Sel. Areas Commun..

[14]  Alexander A. Razborov,et al.  Natural Proofs , 2007 .

[15]  Silvio Micali,et al.  Probabilistic Encryption , 1984, J. Comput. Syst. Sci..

[16]  Carsten Lund,et al.  Proof verification and the hardness of approximation problems , 1998, JACM.

[17]  Cynthia Dwork,et al.  A public-key cryptosystem with worst-case/average-case equivalence , 1997, STOC '97.

[18]  Jacques Stern,et al.  The hardness of approximate optima in lattices, codes, and systems of linear equations , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[19]  Satyanarayana V. Lokam.  Spectral Methods for Matrix Rigidity with Applications to Size-Depth Trade-offs and Communication Complexity , 2001, J. Comput. Syst. Sci..

[20]  Uriel Feige,et al.  Relations between average case complexity and approximation complexity , 2002, STOC '02.

[21]  Johan Håstad,et al.  Dual vectors and lower bounds for the nearest lattice point problem , 1988, Comb..

[22]  Oded Goldreich,et al.  On the limits of non-approximability of lattice problems , 1998, STOC '98.

[23]  A. Razborov,et al.  Improved lower bounds on the rigidity of Hadamard matrices , 1998 .

[24]  Joel Friedman,et al.  A note on matrix rigidity , 1993, Comb..

[25]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[26]  Leslie G. Valiant,et al.  Graph-Theoretic Arguments in Low-Level Complexity , 1977, MFCS.

[27]  Abraham D. Flaxman,et al.  A spectral technique for random satisfiable 3CNF formulas , 2003, SODA '03.