MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named "Michael Alekhnovich" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

12 documents found, showing 1 through 10. Next 10 →

ATOM

bounds for k-DNF resolution on random 3-CNFs
by Michael Alekhnovich — 2005 — In: STOC ’05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
…Lower bounds for k-DNF Resolution on random 3-CNFs Michael Alekhnovich ∗ November 3, 2004 Abstract…
Cited by 5 (1 self) – Add To MetaCart

Satisfiability, Branch-width and Tseitin Tautologies
by Michael Alekhnovich, Alexander A. Razborov — 2002
…Satisability, Branch-width and Tseitin Tautologies Michael Alekhnovich Alexander A. Razborov y…
Cited by 18 (0 self) – Add To MetaCart

Minimum propositional proof length is NP-hard to linearly approximate (extended abstract
by Michael Alekhnovich, Sam Buss, Shlomo Moran, Toniann Pitassi — 1998 — Mathematical foundations of computer science (mfcs ′ 98), Lecture Notes in Computer Science #1450
…Minimum Propositional Proof Length is NP-Hard to Linearly Approximate (Extended Abstract) Michael…
Cited by 30 (5 self) – Add To MetaCart

An Exponential Separation between Regular and General Resolution
by Michael Alekhnovich, Jan Johannsen, Toniann Pitassi, Alasdair Urquhart — 2002 — In Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing
…An Exponential Separation between Regular and General Resolution Michael Alekhnovich Department…
Cited by 21 (3 self) – Add To MetaCart

unknown title
by Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson
…? Michael Alekhnovich1 ??, Edward A. Hirsch2 ? ? ?, and Dmitry Itsykson3# 1 Institute for Advanced Study…
Add To MetaCart

Toward a model for backtracking and dynamic programming
by Michael Alekhnovich, Allan Borodin, Russell Impagliazzo, Avner Magen, Toniann Pitassi — 2005 — In Proceedings of the 20th IEEE Conference on Computational Complexity (CCC
…Toward a Model for Backtracking and Dynamic Programming Michael Alekhnovich ∗ Allan Borodin…
Cited by 12 (3 self) – Add To MetaCart

Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas
by Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson — 2004
…Exponential lower bounds for the running time of DPLL algorithms on satisable formulas Michael…
Cited by 16 (3 self) – Add To MetaCart

Lower Bounds for Polynomial Calculus: Non-Binomial Case
by Michael Alekhnovich, Alexander A. Razborov, Er A. Razborov — 2001
…Lower Bounds for Polynomial Calculus: Non-Binomial Case Michael Alekhnovich # , Alexander A…
Cited by 25 (8 self) – Add To MetaCart

Resolution is Not Automatizable Unless W[P] is Tractable
by Michael Alekhnovich, Alexander A. Razborov, Er A. Razborov — 2001 — In 42nd Annual IEEE Symposium on Foundations of Computer Science
…Resolution is Not Automatizable Unless W[P] is Tractable Michael Alekhnovich , Alexander A…
Cited by 33 (0 self) – Add To MetaCart

Space Complexity in Propositional Calculus
by Michael Alekhnovich, Eli Ben-sasson, Alexander A. Razborov, Avi Wigderson — 2002
…SPACE COMPLEXITY IN PROPOSITIONAL CALCULUS MICHAEL ALEKHNOVICH y , ELI BEN-SASSON z…
Cited by 26 (6 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB