An exponential separation between regular and general resolution
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Resolution is Not Automatizable Unless W[P] is Tractable
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Pseudorandom Generators in Propositional Proof Complexity
SIAM Journal on Computing
Learnability and Automatizability
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Lower bounds for k-DNF resolution on random 3-CNFs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
| Hi-index | 0.01 |
Misha Alekhnovich was born in Moscow, USSR, on October 26, 1978. In 1995 Misha began his studies at Moscow State University and graduated in 2000 with the equivalent of a B.A. in mathematics. In 2000-2001 Misha participated in the Special Year on Computational Complexity at the Institute for Advanced Study, and in 2001-2003 he attended graduate school at MIT. Upon receiving his PhD in 2003, Misha returned to IAS as a postdoctoral member and spent the next two years, 2003-2005, there. In 2005 he moved on to a faculty position at the University of California San Diego.