- Com S 633: Randomness in Computation Lecture 12 Scribe: Aaron Sterling
- SPLITTING NP-COMPLETE SETS CHRISTIAN GLAER, A. PAVAN, ALAN L. SELMAN, AND LIYU ZHANG
- Com S 631: Lower bounds and Separation Results Lecture 5 Scribe: Adam Case
- Com S 633: Randomness in Computation Lecture 6 Scribe: Hongyu Sun
- Com S 633: Randomness in Computation Lecture 5 Scribe: Rakesh Setty
- Mitosis in Computational Complexity Christian Glaer1
- Com S 633: Randomness in Computation Lecture 11 Scribe: Dave Doty
- Com S 633: Randomness in Computation Lecture 14 Scribe: Ankit Agrawal
- Com S 633: Randomness in Computation Lecture 15 Scribe: Rakesh Setty
- Com S 631: Lower bounds and Separation Results Lecture 6 Scribe: Aaron Sterling
- Com S 633: Randomness in Computation Lecture 22 Scribe: K.S.Gopalakrishnan
- SIAM J. COMPUT. c 2007 Society for Industrial and Applied Mathematics Vol. 37, No. 2, pp. 359379
- PROPERTIES OF NP-COMPLETE SETS CHRISTIAN GLAER
- Com S 633: Randomness in Computation Lecture 21 Scribe: Aaron Sterling
- Com S 633: Randomness in Computation Lecture 7 Scribe: Ankit Agrawal
- Com S 631: Lower bounds and Separation Results Lecture 13 Scribe: Aaron Sterling
- Com S 633: Randomness in Computation Lecture 2 Scribe: Dave Doty
- Com S 633: Randomness in Computation Lecture 23 Scribe: K. S. Gopalakrishnan, Hongyu Sun
- Com S 633: Randomness in Computation Lecture 8, 9, 10 Scribe: Xiaoyang Gu
- Comparing Reductions to NP-Complete Sets John M. Hitchcock 1
- Com S 633: Randomness in Computation Lecture 3 Scribe: Aaron Sterling
- Com S 633: Randomness in Computation Lecture 13 Scribe: K.S.Gopalakrishnan
- Com S 631: Lower bounds and Separation Results Lecture 4 Scribe: Ankit Agrawal
- Com S 631: Lower bounds and Separation Results Lecture 1 Scribe: Pavan Aduri
- Com S 631: Lower bounds and Separation Results Lecture 10 Scribe: Sudheer Vakati
- Some Results on Average-Case Hardness within the Polynomial Hierarchy
- Com S 633: Randomness in Computation Lecture 4 Scribe: K. S. Gopalakrishnan
- Com S 633: Randomness in Computation Lecture 17 Scribe: Ankit Agrawal
- This article was published in an Elsevier journal. The attached copy is furnished to the author for non-commercial research and
- This article was published in an Elsevier journal. The attached copy is furnished to the author for non-commercial research and
- Resource-Bounded Strong Dimension versus Resource-Bounded Category
- Complete Distributional Problems, Hard Languages, and Resource-Bounded Measure
- LIPIcs Leibniz International Proceedings in Informatics Kolmogorov Complexity in
- SIGACT News Complexity Theory Column 64 Lane A. Hemaspaandra
- SIGACT News Complexity Theory Column 40 Lane A. Hemaspaandra
- Com S 631: Lower bounds and Separation Results Lecture 14 Scribe: Ankit Agrawal
- Com S 631: Lower bounds and Separation Results Lecture 12 Scribe: Adam Case
- Com S 631: Lower bounds and Separation Results Lecture 7 Scribe: Brian Patterson
- Com S 631: Lower bounds and Separation Results Lecture 2 Scribe: Ruchi Chaudary
- Com S 633: Randomness in Computation Lecture 18 Scribe: Rakesh Setty
- Com S 631: Lower bounds and Separation Results Lecture 8 Scribe: David Lastine
- Reductions Do Not Preserve Fast Convergence Rates in Average Time
- Com S 633: Randomness in Computation Lecture 7 Scribe: Ankit Agrawal
- Com S 633: Randomness in Computation Lecture 14 Scribe: Ankit Agrawal
- Com S 633: Randomness in Computation Lecture 18 Scribe: Rakesh Setty
- Distributionally-Hard Languages Lance Fortnow A. Pavan Alan L. Selman
- Submitted to the Symposium on Theoretical Aspects of Computer Science www.stacs-conf.org
- Com S 633: Randomness in Computation Lectures 19 and 20 Scribe: Ankit Agrawal, Dave Doty
- Com S 633: Randomness in Computation Lecture 1 Scribe: A. Pavan
- Robustness of PSPACE-complete sets A. Pavan a,1
- Com S 631: Lower bounds and Separation Results Lecture 16 Scribe: Sanghack Lee
- Com S 631: Lower bounds and Separation Results Lecture 9 Scribe: Sanghack Lee
- Com S 631: Lower bounds and Separation Results Lecture 3 Scribe: Debasis Mandal
- SEPARATION OF NP-COMPLETENESS NOTIONS AND ALAN L SELMAN