1. All Natural NP-Complete Problems Have Average-Case Complete Versions

   • Noam Livne

   OriginalPaper 06 December 2010 Pages: 477 - 499

2. Random Cnf’s are Hard for the Polynomial Calculus

   • Eli Ben-Sasson
   • Russell Impagliazzo

   OriginalPaper 11 August 2010 Pages: 501 - 519

3. New Results on Noncommutative and Commutative Polynomial Identity Testing

   • V. Arvind
   • Partha Mukhopadhyay
   • Srikanth Srinivasan

   OriginalPaper 06 December 2010 Pages: 521 - 558

4. The Complexity of the Inertia

   • Thanh Minh Hoang
   • Thomas Thierauf

   OriginalPaper 30 August 2010 Pages: 559 - 580

5. Lower Bounds for Agnostic Learning via Approximate Rank

   • Adam R. Klivans
   • Alexander A. Sherstov

   OriginalPaper 11 August 2010 Pages: 581 - 604

6. A Complexity Dichotomy For Hypergraph Partition Functions

   • Martin Dyer
   • Leslie Ann Goldberg
   • Mark Jerrum

   OriginalPaper 06 December 2010 Pages: 605 - 633