Concepedia

M. Alekhnovich

MA

Statistics

Publications

12

Citations

780

H-Index

11

Active since

2001

Affiliations

Institute for Advanced Study(Current)

Princeton University

Hebrew University of Jerusalem

Massachusetts Institute of Technology

Lomonosov Moscow State University

M. Alekhnovich is an author at Institute for Advanced Study specializing in theory of computation, computer science, and mathematics.

Publications per year

2001–2011

12

Publications

12

More on average case vs approximation complexity

M. Alekhnovich · 2004 · 240 citations

, , +14

Linear Diophantine Equations Over Polynomials and Soft Decoding of Reed–Solomon Codes

M. Alekhnovich · IEEE Transactions on Information Theory · 2005 · 105 citations

, , +14

Lower bounds for polynomial calculus: non-binomial case

M. Alekhnovich, Alexander Razborov · 2001 · 98 citations

, , +11

Resolution is not automatizable unless W[P] is tractable

M. Alekhnovich, A.A. Razboro · 2001 · 72 citations

, , +13

Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy

M. Alekhnovich, Sanjeev Arora, Iannis Tourlakis · 2005 · 55 citations

, , +14

1–5 of 12