External Links

    Journal: J. Comput. Syst. Sci.

    Volume 65, Issue 4

    611 -- 0Madhu Sudan. Foreword
    612 -- 625Jürgen Forster. A linear lower bound on the unbounded error probabilistic communication complexity
    626 -- 638Albert Atserias, Nicola Galesi, Pavel Pudlák. Monotone simulations of non-monotone proofs
    639 -- 659Amir Shpilka. Affine projections of symmetric polynomials
    660 -- 671Elchanan Mossel, Christopher Umans. On the complexity of approximating the VC dimension
    672 -- 694Russell Impagliazzo, Valentine Kabanets, Avi Wigderson. In search of an easy witness: exponential time vs. probabilistic polynomial time
    695 -- 716William Hesse, Eric Allender, David A. Mix Barrington. Uniform constant-depth threshold circuits for division and iterated multiplication
    717 -- 726Michal Koucký. Universal traversal sequences with backtracking
    runs on