External Links

    Journal: Computational Complexity

    Volume 17, Issue 3

    353 -- 376Lance Fortnow, Russell Impagliazzo, Valentine Kabanets, Christopher Umans. On the Complexity of Succinct Zero-Sum Games
    377 -- 406Saugata Basu, Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton. Polynomials that Sign Represent Parity and Descartes Rule of Signs
    407 -- 457Ran Raz, Iddo Tzameret. The Strength of Multilinear Proofs
    runs on