31 - 40 out of 43Page size: 10
  1. 2002

  2. Exponential lower bound for static semi-algebraic proofs

    Grigoriev, D., Hirsch, E. A. & Pasechnik, D. V., 1 Dec 2002, Automata, Languages and Programming - 29th International Colloquium, ICALP 2002, Proceedings. p. 257-268 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2380 LNCS).

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

  3. A deterministic (2 - 2/(k + 1))n algorithm for k-SAT based on local search

    Dantsin, E., Goerdt, A., Hirsch, E. A., Kannan, R., Kleinberg, J., Papadimitriou, C., Raghavan, P. & Schöning, U., 23 Oct 2002, In: Theoretical Computer Science. 289, 1, p. 69-83 15 p.

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

  4. Complexity of semi-algebraic proofs

    Grigoriev, D., Hirsch, E. A. & Pasechnik, D. V., 1 Jan 2002, STACS 2002 - 19th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings. Ferreira, A. & Alt, H. (eds.). Springer Nature, p. 419-430 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2285).

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

  5. 2001

  6. MAX SAT approximation beyond the limits of polynomial-time approximation

    Dantsin, E., Gavrilovich, M., Hirsch, E. A. & Konev, B., 27 Dec 2001, In: Annals of Pure and Applied Logic. 113, 1-3, p. 81-94 14 p.

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

  7. Solving Boolean satisfiability using local search guided by unit clause elimination

    Hirsch, E. A. & Kojevnikov, A., 1 Jan 2001, Principles and Practice of Constraint Programming - CP 2001 - 7th International Conference, CP 2001, Proceedings. Walsh, T. (ed.). Springer Nature, p. 605-609 5 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2239).

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

  8. 2000

  9. SAT local search algorithms: worst-case study

    Hirsch, E. A., 1 Feb 2000, In: Journal of Automated Reasoning. 24, 1-2, p. 127-143 17 p.

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

  10. A new algorithm for MAX-2-SAT

    Hirsch, E. A., 1 Jan 2000, STACS 2000 - 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000, Proceedings. Reichel, H. & Tison, S. (eds.). Springer Nature, p. 65-73 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1770).

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

  11. Deterministic algorithms for k-SAT based on covering codes and local search

    Dantsin, E., Goerdt, A., Hirsch, E. A. & Schöning, U., 1 Jan 2000, Automata, Languages and Programming - 27th International Colloquium, ICALP 2000, Proceedings. Montanari, U., Welzl, E. & Rolim, J. D. P. (eds.). Springer Nature, p. 236-247 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1853).

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

  12. New worst-case upper bounds for SAT

    Hirsch, E. A., 1 Jan 2000, In: Journal of Automated Reasoning. 24, 4, p. 397-420 24 p.

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

  13. Separating signs in the propositional satisfiability problem

    Hirsch, E. A., 1 Jan 2000, In: Journal of Mathematical Sciences . 98, 4, p. 442-463 22 p.

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

Previous 1 2 3 4 5 Next

ID: 9072111