Michael Alekhnovich

发表

Pseudorandom generators in propositional proof complexity

Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

Satisfiability, Branch-Width and Tseitin tautologies

Michael Alekhnovich, Alexander A. Razborov, A. Razborov, 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

The complexity of properly learning simple concept classes

Mark Braverman, Michael Alekhnovich, Toniann Pitassi, 2008, J. Comput. Syst. Sci..

Space complexity in propositional calculus

Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, 2000, STOC '00.

Learnability and automatizability

Mark Braverman, Michael Alekhnovich, Toniann Pitassi, 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

An Exponential Separation between Regular and General Resolution

Michael Alekhnovich, Toniann Pitassi, Jan Johannsen, 2007, Theory Comput..

Minimum propositional proof length is NP-hard to linearly approximate

Michael Alekhnovich, Samuel R. Buss, Toniann Pitassi, 1998, Journal of Symbolic Logic.

Satisfiability, Branch-Width and Tseitin tautologies

Michael Alekhnovich, Alexander A. Razborov, 2011, computational complexity.

Linear upper bounds for random walk on small density random 3-CNFs

Michael Alekhnovich, Eli Ben-Sasson, 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

Lower bounds for polynomial calculus: non-binomial case

Michael Alekhnovich, Alexander A. Razborov, A. Razborov, 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

Space Complexity in Propositional Calculus

Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, 2002, SIAM J. Comput..

An exponential separation between regular and general resolution

Michael Alekhnovich, Toniann Pitassi, Jan Johannsen, 2002, STOC '02.

Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas

Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson, 2004, ICALP.

Resolution Is Not Automatizable Unless W[P] Is Tractable

Michael Alekhnovich, Alexander A. Razborov, 2008, SIAM J. Comput..

More on Average Case vs Approximation Complexity

Michael Alekhnovich, 2011, computational complexity.

Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy

Michael Alekhnovich, Sanjeev Arora, Iannis Tourlakis, 2005, STOC.

Pseudorandom Generators in Propositional Proof Complexity

Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, 2004, SIAM J. Comput..

Toward a Model for Backtracking and Dynamic Programming

Allan Borodin, Michael Alekhnovich, Russell Impagliazzo, 2005, Computational Complexity Conference.

Resolution is not automatizable unless W[P] is tractable

Michael Alekhnovich, Alexander A. Razborov, A. Razborov, 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

Linear diophantine equations over polynomials and soft decoding of Reed-Solomon codes

Michael Alekhnovich, 2005, IEEE Trans. Inf. Theory.

Toward a Model for Backtracking and Dynamic Programming

Allan Borodin, Michael Alekhnovich, Russell Impagliazzo, 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).

Linear diophantine equations over polynomials and soft decoding of Reed-Solomon codes

Michael Alekhnovich, 2005, IEEE Transactions on Information Theory.

Mutilated chessboard problem is exponentially hard for resolution

Michael Alekhnovich, Michael Alekhnovich, 2004, Theor. Comput. Sci..

Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas

Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson, 2004, SODA '04.

Lower Bounds for k-DNF Resolution on Random 3-CNFs

Michael Alekhnovich, 2005, STOC '05.

Lower bounds for k-DNF resolution on random 3-CNFs

Michael Alekhnovich, 2005, STOC.

Minimum propositional proof length is NP-hard to linearly approximate

Michael Alekhnovich, Toniann Pitassi, Shlomo Moran, 2001, Journal of Symbolic Logic.