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