( en | de | ru )

 

Disambiguation of "Alekhnovich, Michael"

Author of the publication

copydeleteadd this publication to your clipboard
Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas.

, , and . ICALP, volume 3142 of Lecture Notes in Computer Science, page 84-96. Springer, (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Michael Liecke

Subnationale Clusterpolitik: die Biotechnologiepolitik deutscher Länder im Vergleich. Uni München, (2009)

Michael Schoierer

NS-Diktatur, Anomie und Demokratisierung Westdeutschlands. Uni Augsburg, (2007)

Michael Krug

X-ray crystallographic analysis of the archaeal transcriptional regulator TrmB and development of a graphical user interface for the monochromatic diffraction data processing software XDS. Uni Konstanz, (2009)

Michael Bernateck

Komplexes Regionales Schmerzsyndrom Typ 1 (M.Sudeck): neue Aspekte zur Symptomatologie, Pathogenese, Diagnostik und Therapie. MedH Hannover, habilitation, (2009)

Michael Bode

Le groupe international de sociétés: le système de conflit de lois en droit comparé français et allemand. HU Berlin, (2009)
 

Other publications of authors with the same name

Toward a Model for Backtracking and Dynamic Programming., , , , , and . CCC, page 308-322. IEEE Computer Society, (2005)Space complexity in propositional calculus., , , and . STOC, page 358-367. ACM, (2000)Minimum Propositional Proof Length is NP-Hard to Linearly Approximate., , , and . MFCS, volume 1450 of Lecture Notes in Computer Science, page 176-184. Springer, (1998)Lower bounds for k-DNF resolution on random 3-CNFs.. STOC, page 251-256. ACM, (2005)Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy., , and . STOC, page 294-303. ACM, (2005)Learnability and Automatizability., , , , and . FOCS, page 621-630. IEEE Computer Society, (2004)Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas., , and . ICALP, volume 3142 of Lecture Notes in Computer Science, page 84-96. Springer, (2004)More on Average Case vs Approximation Complexity.. FOCS, page 298-307. IEEE Computer Society, (2003)Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes.. FOCS, page 439-448. IEEE Computer Society, (2002)Lower Bounds for Polynomial Calculus: Non-Binomial Case., and . FOCS, page 190-199. IEEE Computer Society, (2001)