External Links

    Journal: Computational Complexity

    Volume 14, Issue 4

    281 -- 307Shmuel Safra, Oded Schwartz. On the complexity of approximating tsp with neighborhoods and related problems
    308 -- 340Dániel Marx. The complexity of chromatic strength and chromatic edge strength
    341 -- 361Chris Pollett. Languages to diagonalize against advice classes
    362 -- 375Matthias Krause. On the computational power of Boolean decision lists

    Volume 14, Issue 3

    185 -- 0Eric Allender. Special issue, final part Conference on ::::Computational Complexity:::: 2004 Guest Editor s foreword
    186 -- 227Luca Trevisan, Salil P. Vadhan, David Zuckerman. Compression of Samplable Sources
    228 -- 255Harry Buhrman, Troy Lee, Dieter van Melkebeek. Language compression and pseudorandom generators
    256 -- 279Peter Bro Miltersen, N. V. Vinodchandran. Derandomizing Arthur-Merlin Games using Hitting Sets

    Volume 14, Issue 2

    89 -- 0Eric Allender. Special issue Conference on Computational Complexity 2004 Guest Editor s foreword
    90 -- 121Venkatesan Guruswami, Daniele Micciancio, Oded Regev. The complexity of the covering radius problem
    122 -- 152Chris Marriott, John Watrous. Quantum Arthur-Merlin games
    153 -- 183Dániel Marx. Parameterized complexity of constraint satisfaction problems

    Volume 14, Issue 1

    1 -- 19Ran Raz, Amir Shpilka. Deterministic polynomial identity testing in non-commutative models
    20 -- 52Dima Grigoriev, Dmitrii V. Pasechnik. Polynomial-time computing over quadratic maps i: sampling in real algebraic sets
    53 -- 71Saugata Basu, Richard Pollack, Marie-Françoise Roy. Computing the euler-poincaré characteristics of sign conditions
    72 -- 88Lars Kristiansen. Neat function algebraic characterizations of logspace and linspace
    runs on