All Natural NP-Complete Problems Have Average-Case Complete Versions Noam Livne OriginalPaper 06 December 2010 Pages: 477 - 499
Random Cnf’s are Hard for the Polynomial Calculus Eli Ben-SassonRussell Impagliazzo OriginalPaper 11 August 2010 Pages: 501 - 519
New Results on Noncommutative and Commutative Polynomial Identity Testing V. ArvindPartha MukhopadhyaySrikanth Srinivasan OriginalPaper 06 December 2010 Pages: 521 - 558
The Complexity of the Inertia Thanh Minh HoangThomas Thierauf OriginalPaper 30 August 2010 Pages: 559 - 580
Lower Bounds for Agnostic Learning via Approximate Rank Adam R. KlivansAlexander A. Sherstov OriginalPaper 11 August 2010 Pages: 581 - 604
A Complexity Dichotomy For Hypergraph Partition Functions Martin DyerLeslie Ann GoldbergMark Jerrum OriginalPaper 06 December 2010 Pages: 605 - 633