More on average case vs approximation complexity

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 2003-January, Issue , 2003, Pages 298-307

  Alekhnovich, M ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Approximation algorithms; Computer aided software engineering; Computer science; Cryptography; Decoding; Equations; Linear systems; NP complete problem; Polynomials; Public key

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER AIDED SOFTWARE ENGINEERING; COMPUTER SCIENCE; CRYPTOGRAPHY; DECODING; HARDNESS; LINEAR SYSTEMS; MATRIX ALGEBRA; POLYNOMIALS; PROBLEM SOLVING; RIGIDITY; SOFTWARE ENGINEERING;

APPROXIMATION COMPLEXITY; AVERAGE-CASE HARDNESS; COMBINATORIAL PROBLEM; EQUATIONS; INAPPROXIMABILITY; NATURAL DISTRIBUTION; POLYNOMIAL ALGORITHM; PUBLIC KEYS;

APPROXIMATION ALGORITHMS;

EID: 70349358874     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2003.1238204     Document Type: Conference Paper

References (25)

1. M. Alekhnovich, E. Ben-Sasson, A. Razborov, and A. Wigderson. Pseudorandom generators in propositional complexity. In Proceedings of the 41st IEEE FOCS, 2000. Journal version to appear in SIAM Journal on Computing.
2. S. Arora, L. Babai, J. Stern and Z. Sweedy. Hardness of Approximate Optima in Lattices, Codes, and Linear Systems. Journal of Computer and System Sciences, 54(2):317-331, 1997.
3. M. Ajtai and C. Dwork. A Public-Key Cryptosystem with Worst-Case/Average-Case Equivalence. In Proc. on 29th Annual ACM Symposium on Theory of Computing, 284-293, 1997.
4. S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy. Proof Verification and Hardness of Approximation Problems. Journal of ACM, 45(3):501-555, 1998.
5. S. Arora and S. Safra. Probabilistic Checking of Proofs: A New Characterization of NP. Journal of ACM, 45(1):70-122, 1998.
6. E. Ben-Sasson, P. Harsha and S. Raskhodnikova. Some 3CNF Properties are Hard to Test. To appear in Proc. on 35th Annual ACM Symposium on Theory of Computing, 2003.
7. U. Feige. Relations between average case complexity and approximation complexity. In Proc. on 34th Annual ACM Symposium on Theory of Computing, 534-543, 2002.
8. A. Flaxman. A spectral technique for random satisfiable 3CNF formulas. In Proc. on 14th Annual ACM-SIAM Symposium on Discrete Algorithms, 2003.
9. J. Friedman. A note on matrix rigidity. Combinatorica, 13(2):235-239, 1993.
10. D. Gollman and W. Chambers. Clockcontrolled shift registers: a review. IEEE Journal on Selected Areas in Communications (4) 7: 525-533, 1989.
11. O. Goldreich, S. Goldwasser. On the Limits of Non-Approximability of Lattice Problems. In Proc. on 30th Annual ACM Symposium on the Theory of Computing, 1-9, 1998.
12. J. Håstad. Dual Vectors and Lower Bounds for the Nearest Lattice Point Problem. Combinatorica 8 (1):75-81, 1988.
13. J. Håstad. Some optimal inapproximability results. Journal of ACM, 48:798-859, 2001.
14. B. Kashin and A. Razborov. Improved lower bounds on the rigidity of Hadamard matrices. Mathematical Notes, 63(4):471-475, 1998.
15. S. Lokam. Spectral Methods for Matrix Rigidity with Applications to Size-Depth Trade-offs and Communication Complexity. J. of Computer and System Sciences, 63(3): 449-473, 2001.
16. J. Lagarias, H. Lenstra, C. Schnorr. Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice. Combinatorica 10(4): 333-348, 1990.
17. R. McEliece. A Public-Key Cryptosystem Based on Algebraic Coding Theory. Deep Space Network Progress Report 42-44, Jet Propulsion Lab., California Institute of Technology, 114-116, 1978.
18. J. Naor, M. Naor. Small-Bias Probability Spaces: Efficient Constructions and Applications. SIAM J. Computing 22(4): 838-856, 1993.
19. P. Pudlak and Z. Vavřin. Computation of rigidity of order n/r for one simple matrix. Comm. Math. Univ. Carol., 32(2):213-218, 1991.
20. I. Pak and V. Vu. On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes. Discrete Applied Math. 110: 251-272, 2001.
21. A. Razborov. On rigid matrices. Manuscript (in Russian), 1989.
22. A. Razborov and S. Rudich. Natural Proofs. J. of Computer and System Sciences 55(1): 24-35, 1997.
23. M. Shokrollahi, D. Spielman and V. Stemann. A Remark on Matrix Rigidity. Information Processing Letters, 64(6): 283-285, 1997.
24. G. C. Tseitin, On the complexity of derivations in propositional calculus, in: Studies in mathematics and mathematical logic, Part II, ed. A. O. Slissenko, pp. 115-125.
25. L. Valiant. Graph-Theoretic Arguments in Low-Level Complexity. In Proc. 6th Symposium on Mathematical Foundations of Computer Science: 162-176, 1977.