External Links

    Journal: Computational Complexity

    Volume 19, Issue 4

    477 -- 499Noam Livne. All Natural NP-Complete Problems Have Average-Case Complete Versions
    501 -- 519Eli Ben-Sasson, Russell Impagliazzo. Random Cnf s are Hard for the Polynomial Calculus
    521 -- 558Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan. New Results on Noncommutative and Commutative Polynomial Identity Testing
    559 -- 580Thanh Minh Hoang, Thomas Thierauf. The Complexity of the Inertia
    581 -- 604Adam R. Klivans, Alexander A. Sherstov. Lower Bounds for Agnostic Learning via Approximate Rank
    605 -- 633Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum. A Complexity Dichotomy For Hypergraph Partition Functions
    runs on