31 - 33 out of 33Page size: 10
  1. 2007

  2. Lower bounds on static Lovász-Schrijver calculus proofs for Tseitin tautologies

    Itsykson, D. M. & Kojevnikov, A. A., 1 Sep 2007, In: Journal of Mathematical Sciences . 145, 3, p. 4942-4952 11 p.

    Research output: Contribution to journal › Article › peer-review

  3. 2005

  4. Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas

    Alekhnovich, M., Hirsch, E. A. & Itsykson, D., 1 Oct 2005, In: Journal of Automated Reasoning. 35, 1-3, p. 51-72 22 p.

    Research output: Contribution to journal › Article › peer-review

  5. 2004

  6. Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas

    Alekhnovich, M., Hirsch, E. A. & Itsykson, D., 1 Dec 2004, In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3142, p. 84-96 13 p.

    Research output: Contribution to journal › Article › peer-review

Previous 1 2 3 4 Next

ID: 35825084