Skip to main content

computational complexity

Ausgabe 4/2011

Special issue in memory of Misha Alekhnovich

Inhalt (8 Artikel)

Special Issue In Memory of Misha Alekhnovich. Foreword

A. Borodin, T. Pitassi, A. Razborov

Obituary

Max Nalsky, Michael Ostrovsky

Towards Strong Nonapproximability Results in the Lovász-Schrijver Hierarchy

Mikhail Alekhnovich, Sanjeev Arora, Iannis Tourlakis

Satisfiability, Branch-Width and Tseitin tautologies

Michael Alekhnovich, Alexander Razborov

Toward a Model for Backtracking and Dynamic Programming

Michael Alekhnovich, Allan Borodin, Joshua Buresh-Oppenheim, Russell Impagliazzo, Avner Magen, Toniann Pitassi

Hardness of Approximating the Closest Vector Problem with Pre-Processing

Mikhail Alekhnovich, Subhash A. Khot, Guy Kindler, Nisheeth K. Vishnoi

Premium Partner