51 - 54 out of 54Page size: 10
  1. 2005

  2. Automated generation of simplification rules for SAT and MAXSAT

    Kulikov, A. S., 17 Oct 2005, In: Lecture Notes in Computer Science. 3569, p. 430-436 7 p.

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

  3. A 2|E|/4-time algorithm for max-cut

    Kulikov, A. S. & Fedin, S. S., 1 Jan 2005, In: Journal of Mathematical Sciences . 126, 3, p. 1200-1204 5 p.

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

  4. An upper bound O(20.16254n) for exact 3-satisfiability: A simpler proof

    Kulikov, A. S., 1 Jan 2005, In: Journal of Mathematical Sciences . 126, 3, p. 1195-1199 5 p.

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

  5. 2004

  6. Automated proofs of upper bounds on the running time of splitting algorithms

    Fedin, S. S. & Kulikov, A. S., 1 Dec 2004, In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3162, p. 248-259 12 p.

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

Previous 12 3 4 5 6 Next

ID: 9512817