21 - 30 out of 32Page size: 10
  1. 2012

  2. On Optimal Heuristic Randomized Semidecision Procedures, with Applications to Proof Complexity and Cryptography

    Hirsch, E. A., Itsykson, D., Monakhov, I. & Smal, A., 1 Aug 2012, In: Theory of Computing Systems. 51, 2, p. 179-195 17 p.

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

  3. On an optimal randomized acceptor for graph nonisomorphism

    Hirsch, E. A. & Itsykson, D., 28 Feb 2012, In: Information Processing Letters. 112, 5, p. 166-171 6 p.

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

  4. 2011

  5. Lower bounds for myopic DPLL algorithms with a cut heuristic

    Itsykson, D. & Sokolov, D., 26 Dec 2011, Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Proceedings. p. 464-473 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7074 LNCS).

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

  6. The complexity of inversion of explicit Goldreich's function by DPLL algorithms

    Itsykson, D. & Sokolov, D., 23 Jun 2011, Computer Science - Theory and Applications - 6th International Computer Science Symposium in Russia, CSR 2011, Proceedings. p. 134-147 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6651 LNCS).

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

  7. 2010

  8. An infinitely-often one-way function based on an average-case assumption

    Hirsch, E. A. & Itsykson, D. M., 1 Dec 2010, In: St. Petersburg Mathematical Journal. 21, 3, p. 459-468 10 p.

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

  9. On optimal heuristic randomized semidecision procedures, with application to proof complexity

    Hirsch, E. A. & Itsykson, D., 1 Dec 2010, STACS 2010 - 27th International Symposium on Theoretical Aspects of Computer Science. p. 453-464 12 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 5).

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

  10. Structural complexity of AvgBPP

    Itsykson, D., 1 Dec 2010, In: Annals of Pure and Applied Logic. 162, 3, p. 213-223 11 p.

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

  11. Lower bound on average-case complexity of inversion of Goldreich's function by drunken backtracking algorithms

    Itsykson, D., 20 Jul 2010, Computer Science - Theory and Applications - 5th International Computer Science Symposium in Russia, CSR 2010, Proceedings. p. 204-215 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6072 LNCS).

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

  12. 2008

  13. An infinitely-often one-way function based on an average-case assumption

    Hirsch, E. A. & Itsykson, D. M., 28 Jul 2008, Logic, Language, Information and Computation - 15th International Workshop, WoLLIC 2008, Proceedings. p. 208-217 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5110 LNAI).

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

  14. 2007

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

Previous 1 2 3 4 Next

ID: 35825084