11 - 20 out of 43Page size: 10
  1. 2011

  2. Satisfiability certificates verifiable in subexponential time

    Dantsin, E. & Hirsch, E. A., 27 Jun 2011, Theory and Application of Satisfiability Testing - 14th International Conference, SAT 2011, Proceedings. p. 19-32 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6695 LNCS).

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

  3. 2010

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

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

  6. Optimal acceptors and optimal proof systems

    Hirsch, E. A., 15 Jul 2010, Theory and Applications of Models of Computation - 7th Annual Conference, TAMC 2010, Proceedings. p. 28-39 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6108 LNCS).

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

  7. 2009

  8. A feebly secure trapdoor function

    Hirsch, E. A. & Nikolenko, S. I., 29 Oct 2009, Computer Science - Theory and Applications - 4th International Computer Science Symposium in Russia, CSR 2009, Proceedings. p. 129-142 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5675 LNCS).

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

  9. Time hierarchies for cryptographic function inversion with advice

    Grigoriev, D. Y., Hirsch, E. A. & Pervyshev, K. V., 1 May 2009, In: Journal of Mathematical Sciences . 158, 5, p. 633-644 12 p.

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

  10. A complete public-key cryptosystem

    Grigoriev, D., Hirsch, E. A. & Pervyshev, K., 1 Apr 2009, In: Groups, Complexity, Cryptology. 1, 1, p. 1-12 12 p.

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

  11. Worst-case upper bounds

    Dantsin, E. & Hirsch, E. A., 1 Jan 2009, Handbook of Satisfiability. 1 ed. IOS Press, p. 403-424 22 p. (Frontiers in Artificial Intelligence and Applications; vol. 185, no. 1).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › 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. 2006

  15. Several notes on the power of Gomory-Chvátal cuts

    Hirsch, E. A. & Kojevnikov, A., 1 Sep 2006, In: Annals of Pure and Applied Logic. 141, 3, p. 429-436 8 p.

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

Previous 1 2 3 4 5 Next

ID: 9072111