## Abstract

We briefly survey a number of important recent achievements in Theoretical Computer Science (TCS), especially Computational Complexity Theory. We will discuss the PCP Theorem, its implications to inapproximability on combinatorial optimization problems; space bounded computations, especially deterministic logspace algorithm for undirected graph connectivity problem; deterministic polynomial-time primality test; lattice complexity, worst-case to average-case reductions; pseudorandomness and extractor constructions; and Valiant's new theory of holographic algorithms and reductions.

## Keywords

theoretical computer science computational complexity theory PCP theorem inapproximability logspace complexity Reingold's theorem GAP problem primality testing complexity of lattice problems worst-case to average-case reductions pseudorandomness extractors holographic algorithms## Preview

Unable to display preview. Download preview PDF.

## References

- [1]Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, Cliff Stein. Introduction to Algorithms. Second Edition, MIT Press and McGraw-Hill, 2001.Google Scholar
- [2]Hopcroft J E, Ullman J D. Introduction to Automata Theory, Languages, and Computation. Addison Wesley, 1979.Google Scholar
- [3]Manuel Blum, Silvio Micali. How to generate cryptographically strong sequences of pseudo random bits. In
*Proc. 23rd IEEE Symp. Foundations of Computer Science*, 1982, pp.112–117.Google Scholar - [4]Andrew Chi-Chih Yao. Theory and applications of trapdoor functions (extended abstract). In
*Proc. 23rd IEEE Symposium on Foundations of Computer Science*, 1982, pp.80–91.Google Scholar - [5]Cook S A. The complexity of theorem proving procedures. In
*Proc. 3rd ACM Symp. Theory of Computing*, 1971, pp.151–158.Google Scholar - [6]Shafi Goldwasser, Silvio Micali, Charles Rackoff. The knowledge complexity of interactive proof systems.
*SIAM Journal on Computing*, 1989, 18(1): 186–208.CrossRefMathSciNetGoogle Scholar - [7]László Babai. Trading group theory for randomness. In
*Proc. 17th ACM Symp. Theory of Computing*, 1985, pp.421–429.Google Scholar - [8]László Babai, Shlomo Moran. Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes.
*Journal of Computer and System Sciences*, 1988, 36(2): 254-276.CrossRefMathSciNetGoogle Scholar - [9]Shafi Goldwasser, Michael Sipser. Private coins versus public coins in interactive proof systems. In
*Proc. 18th ACM Symposium on Theory of Computing*, 1986, pp.59–68.Google Scholar - [10]Richard Karp. Reducibility Among Combinatorial Problems. Complexity of Computer Computations, Miller R E, Thatcher J W (eds.), NY: Plenam Press, 1972, pp.85–103.Google Scholar
- [11]Carsten Lund, Lance Fortnow, Howard J Karloff, Noam Nisan. Algebraic methods for interactive proof systems. In
*Proc. 31st IEEE Symposium on Foundations of Computer Science*, 1990, pp.2–10.Google Scholar - [12]Adi Shamir. IP = PSPACE.
*Journal of the ACM*, 1992, 39(4): 869–877.CrossRefzbMATHMathSciNetGoogle Scholar - [13]Michael Ben-Or, Shafi Goldwasser, Joe Kilian, Avi Wigderson. Multi-prover interactive proofs: How to remove intractability assumptions. In
*Proc. 20th ACM Symposium on Theory of Computing*, 1988, pp.113–131.Google Scholar - [14]Uriel Feige, Shafi Goldwasser, Lszl Lovász, Shmuel Safra, Mario Szegedy. Interactive proofs and the hardness of approximating cliques.
*Journal of the ACM*, 1996, 43(2): 268–292.MathSciNetGoogle Scholar - [15]Savitch W J. Relationships between nondeterministic and deterministic tape complexities.
*Journal of Computer and System Sciences*, 1970, 4(2): 177–192.zbMATHMathSciNetGoogle Scholar - [16]Aleliunas R, Karp R M, Lipton R J
*et al*. Random walks, universal traversal sequences, and the complexity of maze problems. In*Proc. 20th IEEE Symposium on Foundations of Computer Science*, 1979, pp.218–223.Google Scholar - [17]Nisan N. Pseudorandom generators for space-bounded computation.
*Combinatorica*, 1992, 12(4): 449–461.CrossRefzbMATHMathSciNetGoogle Scholar - [18]Noam Nisan, Endre Szemerédi, Avi Wigderson. Undirected connectivity in
*O*(log^{1.5}*n*) space. In*Proc. 33rd IEEE Symposium on Foundations of Computer Science*, 1992, pp.24–29.Google Scholar - [19]Saks M, Zhou S.
*BP*_{H}*SPACE*(*S*)⊂*eqDSPACE*(*S*^{3/2}).*Journal of Computer and System Sciences*, 1999, 58: 376–403.CrossRefMathSciNetGoogle Scholar - [20]Armoni R, Amnon Ta-Shma, Wigderson A, Zhou S. An O(log (
*n*)^{4/3}) space algorithm for (*s*,*t*) connectivity in undirected graphs.*Journal of the ACM*, 2000, 47(2): 294–311.CrossRefMathSciNetGoogle Scholar - [21]Cai J-Y, Chakaravarthy V T, van Melkebeek D. Time-space tradeoff in derandomizing probabilistic logspace. In
*Proc. 21st International Symposium on Theoretical Aspects of Computer Science*, 2004, pp.571–583.Google Scholar - [22]Reingold O, Vadhan S, Wigderson A. Entropy waves, the zig-zag graph product, and new constant-degree expanders.
*Annals of Mathematics*, 2001, 155(1): 157–187.MathSciNetGoogle Scholar - [23]Reingold O. Undirected st-connectivity in log-space. In
*Proc. 37th ACM Symposium on the Theory of Computing*, 2005. (To appear)Google Scholar - [24]Irit Dinur. The PCP theorem by gap amplification. Electronic colloquium on computational complexity. Report TR05-046, http://eccc.uni-trier.de/eccc-reports/2005/TR05-046/index.html
- [25]Neil Immerman. Nondeterministic space is closed under complementation.
*SIAM Journal on Computing*, 1988, 17(5): 935–938.CrossRefzbMATHMathSciNetGoogle Scholar - [26]Róbert Szelepcsényi. The method of forcing for nondeterministic automata.
*Bulletin of the European Association for Theoretical Computer Science*, 1987, 33: 96–100.zbMATHGoogle Scholar - [27]Pratt V R. Every prime has a succinct certificate.
*SIAM Journal on Computing*, 1975, 4: 214–220.zbMATHMathSciNetGoogle Scholar - [28]Solovay R, Strassen V. A fast Monte-Carlo test for primality.
*SIAM Journal on Computing*, 1977, 6: 84–85.CrossRefMathSciNetGoogle Scholar - [29]Rabin M O. Probabilistic algorithm for testing primality.
*Journal of Number Theory*, 1980, 12: 128–138.CrossRefzbMATHMathSciNetGoogle Scholar - [30]Miller G L. Riemann's hypothesis and tests for primality. In
*Proc. Seventh Annual ACM Symposium on the Theory of Computing*, 1975, pp.234–239.Google Scholar - [31]Adleman L, Huang M-D. Recognizing primes in random polynomial time. In
*Proc. 19th ACM Symposium on Theory of Computing*, 1987, pp.462–469.Google Scholar - [32]Manindra Agrawal, Neeraj Kayal, Nitin Saxena. PRIMES is in P.
*Annals of Mathematics*, 2004, 160: 781–793.MathSciNetGoogle Scholar - [33]Granville A. It is easy to determine whether a given integer is prime.
*Bull. Amer. Math. Soc*., 2005, 42: 3–38.CrossRefzbMATHMathSciNetGoogle Scholar - [34]Shor P. Algorithms for quantum computation: Discrete logarithms and factoring. In
*Proc. 35th Annual Symposium on Foundations of Computer Science*, 1994, pp.124–134.Google Scholar - [35]Lenstra A K, Lenstra H W, Lovász L. Factoring polynomials with rational coefficients.
*Mathematische Annalen*, 1982, 261: 515–534.CrossRefMathSciNetGoogle Scholar - [36]Lenstra H W Jr. Integer programming with a fixed number of variables.
*Mathematics of Operations Research*, 1983, 8: 538–548.zbMATHMathSciNetGoogle Scholar - [37]Lovász L. An Algorithmic Theory of Numbers, Graphs and Convexity.
*SIAM*, Philadelphia, 1986.Google Scholar - [38]Ajtai M. Generating hard instances of lattice problems. In
*Proc. 28th ACM Symp. the Theory of Computing*, 1996, pp.99–108. Full version available from ECCC as TR96-007.Google Scholar - [39]Ajtai M. The shortest vector problem in
*L*_{2}is NP-hard for randomized reductions. In*Proc. 30th ACM Symposium on the Theory of Computing*, 1998, pp.10–19. Full version available from ECCC as TR97-047.Google Scholar - [40]Ajtai M, Dwork C. A public-key cryptosystem with worst-case/average-case equivalence. In
*Proc. 29th ACM Symposium on the Theory of Computing*, 1997, pp.284–293. Full version available from ECCC as TR96-065.Google Scholar - [41]Cai J-Y, Nerurkar A. An improved worst-case to average-case connection for lattice problems. In
*Proc. 38th IEEE Symposium on Foundations of Computer Science*, 1997, pp.468–477.Google Scholar - [42]Goldreich O, Goldwasser S. On the limits of non-approximability of lattice problems. In
*Proc. 30th ACM Symposium on Theory of Computing*, 1998, pp.1–9,*J. Comput. Syst. Sci*., 2000, 60(3): 540–563.Google Scholar - [43]Goldreich O, Goldwasser S, Halevi S. Public-key cryptosystems from lattice reduction problems. In
*Advances in Cryptology — CRYPTO '97*, Burton S Kaliski Jr. (ed.), Lecture Notes in Computer Science, Springer-Verlag, 1997, 1294: 112–131.Google Scholar - [44]Micciancio D. The shortest vector in a lattice is hard to approximate to within some constant. In
*Proc. 39th IEEE Symposium on Foundations of Computer Science*, 1998, pp.92–98.Google Scholar - [45]Nguyen P, Stern J. A converse to the Ajtai-Dwork security proof and its cryptographic implications. Available from ECCC as TR98-010.Google Scholar
- [46]Daniele Micciancio, Oded Regev. Worst-case to average-case reductions based on Gaussian measures. In
*Proc. 45th IEEE Symp. Foundations of Computer Science*, 2004, pp.372–381.Google Scholar - [47]Subhash Khot. Hardness of approximating the shortest vector problem in lattices. In
*Proc. 45th IEEE Symposium on Foundations of Computer Science*, 2004, pp.126–135.Google Scholar - [48]Dorit Aharonov, Oded Regev. Lattice problems in NP ∩ coNP. In
*Proc. 45th IEEE Symposium on Foundations of Computer Science*, 2004, pp.362–371.Google Scholar - [49]Cai J-Y. A relation of primal-dual lattices and the complexity of shortest lattice vector problem.
*Theoretical Computer Science*, 1998, 207: 105–116.CrossRefzbMATHMathSciNetGoogle Scholar - [50]Cai J-Y. A worst-case to average-case connection for closest vector problem. In
*Proc. 42nd IEEE Symposium on Foundations of Computer Science*, 2001, pp.308–317.Google Scholar - [51]Metropolis N, Ulam S. The Monte Carlo method.
*Journal of American Statistical Association*, 1949, 44: 335–341.MathSciNetGoogle Scholar - [52]Donald E Knuth. The Art of Computer Programming. Third Edition, Reading, Massachusetts: Addison-Wesley, 1997.Google Scholar
- [53]Hastad J, Impagliazzo R, Levin L, Luby M. A pseudorandom generator from any one-way function.
*SIAM Journal on Computing*, 1999, 28(4): 1364–1396.MathSciNetGoogle Scholar - [54]Carter L, Wegman M. Universal hash functions.
*Journal of Computer and System Sciences*, 1979, 18: 143–154.CrossRefMathSciNetGoogle Scholar - [55]Santha M, Vazirani U V. Generating quasi-random sequences from semi-random sources.
*Journal of Computer and System Sciences*, 1986, 33(1): 75–87.CrossRefMathSciNetGoogle Scholar - [56]Vazirani U V, Vazirani V V. Random polynomial time is equal to slightly-random polynomial time. In
*Proc. 26th IEEE Symp. Foundations of Computer Science*, 1985, pp.417–428.Google Scholar - [57]Noam Nisan, David Zuckerman. Randomness is linear in space.
*J. Comput. Syst. Sci*., 1996, 52(1): 43–52.MathSciNetGoogle Scholar - [58]Chi-Jen Lu, Omer Reingold, Salil P Vadhan, Avi Wigderson. Extractors: Optimal up to constant factors. In
*Proc. 35th ACM Symp. the Theory of Computing*, 2003, pp.602–611.Google Scholar - [59]Luca Trevisan. Extractors and pseudorandom generators.
*Journal of the ACM*, 2001, 48(4): 860–879.CrossRefMathSciNetGoogle Scholar - [60]Ran Raz, Omer Reingold, Salil P Vadhan. Extracting all the randomness and reducing the error in Trevisan's extractors.
*J. Comput. Syst. Sci*., 2002, 65(1): 97–128.MathSciNetGoogle Scholar - [61]Leslie G Valiant. Holographic algorithms (extended abstract). In
*Proc. 45th IEEE Symp. Foundations of Computer Science*, 2004, pp.306–315. A more detailed version appeared in Electronic Colloquium on Computational Complexity Report TR05-099.Google Scholar - [62]Temperley H N V, Fisher M E. Dimer problem in statistical mechanics — An exact result.
*Philosophical Magazine*, 1961, 6: 1061–1063.MathSciNetGoogle Scholar - [63]Kasteleyn P W. The statistics of dimers on a lattice.
*Physica*, 1961, 27: 1209–1225.CrossRefGoogle Scholar - [64]Kasteleyn P W. Graph Theory and Crystal Physics. Graph Theory and Theoretical Physics, Harary F (ed.), London: Academic Press, 1967, pp.43–110.Google Scholar
- [65]Cai J-Y, Choudhary V. Valiant's Holant Theorem and Matchgate Tensors. (To appear)Google Scholar
- [66]Jerrum M. Two-dimensional monomer-dimer systems are computationally intractible.
*J. Stat. Phys*., 1987, 48: 121–134; erratum, 1990, 59: 1087–1088.Google Scholar - [67]Salil P Vadhan. The complexity of counting in sparse, regular, and planar graphs.
*SIAM J. Comput*., 2001, 31(2): 398–427.CrossRefzbMATHMathSciNetGoogle Scholar - [68]Leslie G Valiant. Quantum circuits that can be simulated classically in polynomial time.
*SIAM Journal of Computing*, 2002, 31(4): 1229–1254.CrossRefzbMATHMathSciNetGoogle Scholar - [69]Leslie G Valiant. Expressiveness of matchgates.
*Theoretical Computer Science*, 2002, 281(1): 457–471. See also 2003, 299: 795.Google Scholar - [70]Leslie G Valiant. Holographic circuits. In
*Proc. 32nd International Colloquium on Automata, Languages and Programming*, 2005. (To appear)Google Scholar - [71]Leslie G Valiant. Completeness for parity problems. In
*Proc. 11th International Computing and Combinatorics Conference*, 2005. (To appear)Google Scholar - [72]Cai J-Y, Choudhary V. Liant's Holant theorem and matchgate tensors. Available from ECCC, Electronic Colloquium on Computational Complexity TR05-118, at http://www/eccc.uni-trier.de/eccc/

## Copyright information

© Springer Science + Business Media, Inc. 2005