Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Alekhnovich, Michael - Institute for Advanced Study, Princeton University
Linear Upper Bounds for Random Walk on Small Density Random 3CNFs Mikhail Alekhnovich
Lower bounds for kDNF Resolution on random 3CNFs Michael Alekhnovich #
Pseudorandom Generators in Propositional Proof Complexity
Mutilated Chessboard problem is exponentially hard for Michael Alekhnovich
More on average case vs approximation complexity Michael Alekhnovich
Linear Diophantine equations over polynomials and soft decoding of ReedSolomon codes
Resolution is Not Automatizable Unless W[P] is Tractable
SPACE COMPLEXITY IN PROPOSITIONAL CALCULUS # MICHAEL ALEKHNOVICH + , ELI BENSASSON # , ALEXANDER A. RAZBOROV , AND
Toward a Model for Backtracking and Dynamic Programming Michael Alekhnovich Allan Borodin y Joshua Buresh-Oppenheim z
Lower Bounds for Polynomial Calculus: NonBinomial Case
Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas #
Towards strong nonapproximability results in the LovaszSchrijver Mikhail Alekhnovich # Sanjeev Arora + Iannis Tourlakis #
Satis ability, Branch-width and Tseitin Tautologies
An Exponential Separation between Regular and General Michael Alekhnovich
Hardness of Approximating the Closest Vector Problem with Pre-Processing [Extended Abstract]
Learnability and Automatizability Misha Alekhnovich
