Adam R. Klivans
- AK97.V. Arvind and J. KObler. On pseudorandomness and resource-bounded measure. In Proceedings I 7th Conference on the Foundations of Software Technology and Theoretical Computer Science, volume 1346 of Lecture Notes in Computer Science, pages 235-249. Springer-Verlag, 1997. Google Scholar
Digital Library
- AKL+79.R. Aleliunas, R. Karp, R. Lipton, L. Lov,Ssz, and C. Rackoff. Random walks, universal traversal sequences, and the complexity of maze problems. In Proceedings of the 20th IEEE Symposium on Foundations of Computer Science, pages 218-223. IEEE, 1979.Google ScholarDigital Library
- Ang88.D. Angluin. Queries and concept learning. Machine Learning, 2(4):319-342, t 988. Google ScholarDigital Library
- Bab85.L. Babai. Trading group theory for randomness. In Proceedings of the 17th ACM Symposium on the Theory of Computing, pages 421-429. ACM, 1985. Google ScholarDigital Library
- BCG+96.N. Bshouty, R. Cleve, R. Gavald~, S. Kannan. and C. Tamon. Oracles and queries that are sufficient for exact learning. Journal of Computer and System Sciences, 52(3):421-433, t996. Google ScholarDigital Library
- BDG90.J. Balc,Szar, J. Dfaz, and $. Gabarr6. Structural Complexity II, volume 22 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1990.Google Scholar
- BDG95.J. Balctizar, J. Dfaz, and J. Gabarr6. Structural Complexity 1, volume I 1 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, t995. Google ScholarDigital Library
- BFNW93.L. Babai, L. Formow, N. Nisan, and A. Wigderson. BPP has subexponential time simulations unless EX- PTIME has publishable proofs. Computational Complexity, 3:307-318, 1993. Google ScholarDigital Library
- BKL83.L. Bahai, W. Kantor, and E. Luks. Computational complexity and the classification of finite simple groups. In Proceedings of the 24th IEEE Symposium on Foundations of Computer Science, pages 162-171. IEEE, 1983.Google Scholar
- BL83.L. Bahai and E. Luks. Canonical labeling of graphs. In Proceedings of the 15th ACM Symposium on the Theory of Computing, pages t71-183. ACM, 1983. Google ScholarDigital Library
- BM84.M. B!um and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal on Computing, 13:850--864, 1984. Google ScholarDigital Library
- BM88.L. Babai and S. Moran. Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity classes. Journal of Computer and System Sciences, 36:254-276, 1988. Google ScholarDigital Library
- BNS92.L. Babai, N. Nisan, and M. Szegedy. Multiparty protocols, pseudorandom generators for logspace, and timespace trade-offs. Journal of Computer and System Sciences, 45:204--232, 1992. Google ScholarDigital Library
- CRT98.A. Clementi, I. Rotim, and L. Trevisan. Recent advances towards proving P = BPP. Bulletin of the European Association for Theoretical Computer Science, 64:96-103, February 1998.Google Scholar
- FFK94.S. Fenner, L. Fortnow, and S. Kurtz. Gap-definable counting classes. Journal of Computer and System Sciences, 48(I): 116-148, 1994. Google ScholarDigital Library
- For97.L. Fortnow. Counting complexity. In L. Hemaspaandra and A. Selman, editors, Complexity Theory Retrospective H, pages 81-107. Springer-Vertag, 1997. Google ScholarDigital Library
- Fri90.J. Friedman. A note on matrix rigidity. Technical Report TR-308-91, Department of Computer Science, Princeton University, 1990.Google Scholar
- GMW91.O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM, 38:691-729, 1991. Google ScholarDigital Library
- GS89.S. Goldwasser and M. Sipser. Private coins versus public coins in interactive proof systems. In S. Micati, editor, Randomness and Computation, volume 5 of Advances in Computing Research, pages 73-90. JAI Press, Greenwich, 1989.Google Scholar
- Imp95.R. Impagliazzo. Hard-core distributions for somewhat hard problems. In Proceedings of the 36th IEEE Symposium on Foundations of Computer Science, pages 538-545. IEEE, 1995. Google ScholarDigital Library
- IW97.R. Impagliazzo and A. Wigderson. P=BPP unless E has sub-exponential circuits: Derandomizing the XOR lemma. In Proceedings of the 29th ACM Symposium on the Theory of Computing, pages 220--229. ACM, 1997. Google ScholarDigital Library
- Lit88.N. Littlestone. Learning when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285-318, 1988. Google ScholarDigital Library
- LP82.H. Lewis and Ch. Papadimitriou. Symmetric spacebounded computation. Theoretical Computer Science, 19(2):161-I87, t982.Google ScholarCross Ref
- Mil98.E Bro Miltersen. Relativizable pseudorandom generators and extractors. Comment to ECCC Technical Report TR98-055, 1998.Google Scholar
- Nis92.N. Nisan. Pseudorandom generators for spacebounded computation. Combinatorica, 12:449--461, 1992.Google ScholarCross Ref
- NW94.N. Nisan and A. Wigderson. Hardness vs. randomness. Journal of Computer and System Sciences, 49:149- 167, 1994. Google ScholarDigital Library
- Pap94.Ch. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.Google Scholar
- PV91.P. Pudlfik and Z. Vavffn. Computation of rigidity of order n2/r for one simple matrix. Comment. Math. Univ. Carolinae, 32:213-218, 1991.Google Scholar
- PW90.L. Pitt and M. Warmuth. Prediction preserving reducibility. Journal of Computer and System Sciences, 41 (3):430--467, 1990. Google ScholarDigital Library
- Raz.A. Razborov. On rigid matrices. Manuscript in Russian.Google Scholar
- Rud97.S. Rudich. Super-bits, demi-bits, and NP/qpolynatural proofs. In Proceedings of the Ist International Symposium on Randomization and Approximation Techniques in Computer Science, volume 1269 of Lecture Notes in Computer Science, pages 85-93. Springer-Verlag, 1997. Google ScholarDigital Library
- TO92.S. Toda and M. Ogiwara. Counting classes are at least as hard as the polynomial-time hierarchy. SIAM Journal on Computing, 21(2):316-328, 1992. Google ScholarDigital Library
- Tod91.S. Toda. PP is as hard as the polynomial-time hierarchy. SIAM Journal on Computing, 20(5):865-877, 1991. Google ScholarDigital Library
- Tre98.L. Trevisan. Constructions of near-optimal extractors using pseudo-random generators. Technical Report TR-98-055, Electronic Colloquium on Computational Complexity, 1998.Google Scholar
- Vad98.S. Vadhan. Extracting all the randomness from a weakly random source. Technical Report TR-98-047, Electronic Colloquium on Computational Complexity, 1998. Google ScholarDigital Library
- Val77.L. Valiant. Graph4heoretic arguments in low-level complexity. In Proceedings of the 6th Symposium on Mathematical Foundations of Computer Science, volume 53 of Lecture Notes in Computer Science, pages 162-176. Spfinger-Verlag, 1977.Google ScholarCross Ref
- VV86.L. Valiant and V. Vazirani. NP is as easy as detecting unique solutions. TheoreffcaI Computer Science, 47:85-93, 1986. Google ScholarDigital Library
- Yao82.A. Yao. Theory and applications of trapdoor functions. In Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, pages 80-91. IEEE, 1982.Google ScholarCross Ref
Index Terms
- Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses
Recommendations
Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
Traditional hardness versus randomness results focus on time-efficient randomized decision procedures. We generalize these trade-offs to a much wider class of randomized processes. We work out various applications, most notably to derandomizing Arthur-...
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
STOC '10: Proceedings of the forty-second ACM symposium on Theory of computingConsider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computationally unbounded but does not know any part of x; their goal is to ...
Comments