Order:
  1.  2
    On Obdd-Based Algorithms and Proof Systems That Dynamically Change Order of Variables.Dmitry Itsykson, Alexander Knop, Andrei Romashchenko & Dmitry Sokolov - forthcoming - Journal of Symbolic Logic:1-41.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  2.  8
    Resolution Over Linear Equations Modulo Two.Dmitry Itsykson & Dmitry Sokolov - 2020 - Annals of Pure and Applied Logic 171 (1):102722.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  3.  12
    Structural Complexity Of.Dmitry Itsykson - 2010 - Annals of Pure and Applied Logic 162 (3):213-223.
    We study the class that consists of distributional problems which can be solved in average polynomial time by randomized algorithms with bounded error. We prove that there exists a distributional problem that is complete for under polynomial time samplable distributions. Since we use deterministic reductions, the existence of a deterministic algorithm with average polynomial running time for our problem would imply. Note that, while it is easy to construct a promise problem that is complete for, it is unknown whether contains (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark