21 - 30 out of 43Page size: 10
  1. 2006

  2. Clause shortening combined with pruning yields a new upper bound for deterministic SAT algorithms

    Dantsin, E., Hirsch, E. A. & Wolpert, A., 1 Jan 2006, Algorithms and Complexity - 6th Italian Conference, CIAC 2006, Proceedings. Springer Nature, p. 60-68 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3998 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  3. 2005

  4. Simulating Cutting Plane proofs with restricted degree of falsity by resolution

    Hirsch, E. A. & Nikolenko, S. I., 17 Oct 2005, In: Lecture Notes in Computer Science. 3569, p. 135-142 8 p.

    Research output: Contribution to journal › Conference article › peer-review

  5. 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

  6. The SAT2002 competition

    Simon, L., Le Berre, D. & Hirsch, E. A., Jan 2005, In: Annals of Mathematics and Artificial Intelligence. 43, 1-4, p. 307-342 36 p.

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

  7. UnitWalk: A new SAT solver that uses local search guided by unit clause elimination

    Hirsch, E. A. & Kojevnikov, A., Jan 2005, In: Annals of Mathematics and Artificial Intelligence. 43, 1-4, p. 91-111 21 p.

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

  8. 2004

  9. Algorithms for SAT based on search in hamming balls

    Dantsin, E., Hirsch, E. A. & Wolpert, A., 1 Dec 2004, In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2996, p. 141-151 11 p.

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

  10. 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

  11. 2003

  12. Worst-case study of local search for MAX-k-SAT

    Hirsch, E. A., 15 Aug 2003, In: Discrete Applied Mathematics. 130, 2, p. 173-184 12 p.

    Research output: Contribution to journal › Conference article › peer-review

  13. Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT

    Gramm, J., Hirsch, E. A., Niedermeier, R. & Rossmanith, P., 15 Aug 2003, In: Discrete Applied Mathematics. 130, 2, p. 139-155 17 p.

    Research output: Contribution to journal › Conference article › peer-review

  14. Algebraic proof systems over formulas

    Grigoriev, D. & Hirsch, E. A., 28 Jun 2003, In: Theoretical Computer Science. 303, 1, p. 83-102 20 p.

    Research output: Contribution to journal › Conference article › peer-review

Previous 1 2 3 4 5 Next

ID: 9072111