Journal: Computational Complexity

Volume 20, Issue 4

579 -- 590Allan Borodin, Toniann Pitassi, Alexander A. Razborov. Special Issue In Memory of Misha Alekhnovich. Foreword
591 -- 595Max Nalsky, Michael Ostrovsky. Obituary
597 -- 614Michael Alekhnovich. Lower Bounds for k-DNF Resolution on Random 3-CNFs
615 -- 648Mikhail Alekhnovich, Sanjeev Arora, Iannis Tourlakis. Towards Strong Nonapproximability Results in the Lovász-Schrijver Hierarchy
649 -- 678Michael Alekhnovich, Alexander A. Razborov. Satisfiability, Branch-Width and Tseitin tautologies
679 -- 740Michael Alekhnovich, Allan Borodin, Joshua Buresh-Oppenheim, Russell Impagliazzo, Avner Magen, Toniann Pitassi. Toward a Model for Backtracking and Dynamic Programming
741 -- 753Mikhail Alekhnovich, Subhash Khot, Guy Kindler, Nisheeth K. Vishnoi. Hardness of Approximating the Closest Vector Problem with Pre-Processing
755 -- 786Michael Alekhnovich. More on Average Case vs Approximation Complexity

Volume 20, Issue 3

413 -- 504Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra. PCP Characterizations of NP: Toward a Polynomially-Small Error-Probability
505 -- 558Venkatesan T. Chakaravarthy, Sambuddha Roy. Arthur and Merlin as Oracles
559 -- 578Pavel Hrubes, Amir Yehudayoff. Homogeneous Formulas and Symmetric Polynomials

Volume 20, Issue 2

173 -- 175Dieter van Melkebeek. Special Issue Conference on Computational Complexity 2010 Guest Editor s Foreword
177 -- 206Alexandra Kolla. Spectral Algorithms for Unique Games
207 -- 327Irit Dinur, Or Meir. Derandomized Parallel Repetition via Structured PCPs
329 -- 366Baris Aydinlioglu, Dan Gutfreund, John M. Hitchcock, Akinori Kawachi. Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds
367 -- 388Zeev Dvir. On Matrix Rigidity and Locally Self-correctable Codes
389 -- 412Daniel M. Kane. The Gaussian Surface Area and Noise Sensitivity of Degree-::::d:::: Polynomial Threshold Functions

Volume 20, Issue 1

1 -- 20Pascal Koiran, Sylvain Perifel. Interpolation in Valiant s Theory
21 -- 50Mark Kambites. Generic Complexity of Finitely Presented Monoids and Semigroups
51 -- 85Stefan S. Dantchev, Barnaby Martin, Stefan Szeider. Parameterized Proof Complexity
87 -- 143Ronen Shaltiel. Weak Derandomization of Weak Algorithms: Explicit Versions of Yao s Lemma
145 -- 171Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu. Complexity of Hard-Core Set Proofs