Dmitry Itsykson

发表

Proof complexity of natural formulas via communication arguments

Dmitry Itsykson, Artur Riazanov, 2020, Electron. Colloquium Comput. Complex..

Reordering Rule Makes OBDD Proof Systems Stronger

Samuel R. Buss, Alexander Knop, Dmitry Itsykson, 2018, Electron. Colloquium Comput. Complex..

Resolution Complexity of Perfect Matching Principles for Sparse Graphs

Dmitry Itsykson, Dmitry Sokolov, Mikhail Slabodkin, 2014, CSR.

Structural complexity of AvgBPP

Dmitry Itsykson, 2010, Ann. Pure Appl. Log..

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

Edward A. Hirsch, Dmitry Itsykson, Ivan Monakhov, 2012, Theory of Computing Systems.

Lower Bounds on OBDD Proofs with Several Orders

Samuel R. Buss, Dmitry Sokolov, Alexander Knop, 2020, Electron. Colloquium Comput. Complex..

Lower Bound on Average-Case Complexity of Inversion of Goldreich’s Function by Drunken Backtracking Algorithms

Dmitry Itsykson, 2013, Theory of Computing Systems.

Resolution over linear equations modulo two

Dmitry Sokolov, Dmitry Itsykson, Dmitry Sokolov, 2020, Ann. Pure Appl. Log..

Structural Complexity of AvgBPP

Dmitry Itsykson, 2009, CSR.

On OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of Variables

Alexander Knop, Andrei E. Romashchenko, Dmitry Itsykson, 2017, STACS.

Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies

Arist Kojevnikov, Dmitry Itsykson, A. Kojevnikov, 2006, ICALP.

An Infinitely-Often One-Way Function Based on an Average-Case Assumption

Edward A. Hirsch, Dmitry Itsykson, E. Hirsch, 2008, WoLLIC.

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

Edward A. Hirsch, Dmitry Itsykson, 2010, STACS.

Optimal heuristic algorithms for the image of an injective function

Edward A. Hirsch, Dmitry Itsykson, Alexander Smal, 2011, Electron. Colloquium Comput. Complex..

Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs

Dmitry Itsykson, Ludmila Glinskih, 2017, MFCS.

Complexity of Distributions and Average-Case Hardness

Alexander Knop, Dmitry Itsykson, Dmitry Sokolov, 2015, ISAAC.

Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas

Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson, 2004, ICALP.

Lower Bounds for Splittings by Linear Combinations

Dmitry Itsykson, Dmitry Sokolov, 2014, MFCS.

On an optimal randomized acceptor for graph nonisomorphism

Edward A. Hirsch, Dmitry Itsykson, 2012, Inf. Process. Lett..

On Fast Heuristic Non-deterministic Algorithms and Short Heuristic Proofs

Dmitry Itsykson, Dmitry Sokolov, 2014, Fundam. Informaticae.

Bounded-depth Frege complexity of Tseitin formulas for all graphs

Nicola Galesi, Dmitry Itsykson, Artur Riazanov, 2019, Electron. Colloquium Comput. Complex..

Tight Lower Bounds on the Resolution Complexity of Perfect Matching Principles

Dmitry Itsykson, Dmitry Sokolov, Mikhail Slabodkin, 2016, Fundam. Informaticae.

Tree-like resolution complexity of two planar problems pdf

Dmitry Itsykson, Dmitry Sokolov, Vsevolod Oparin, 2014, ArXiv.

Lower Bounds for Myopic DPLL Algorithms with a Cut Heuristic

Dmitry Itsykson, Dmitry Sokolov, 2011, ISAAC.

Hard Satisfiable Formulas for Splittings by Linear Combinations

Alexander Knop, Dmitry Itsykson, 2017, SAT.

Computational and Proof Complexity of Partial String Avoidability

Alexander Okhotin, Dmitry Itsykson, Vsevolod Oparin, 2021, MFCS.

Lower Bound on Average-Case Complexity of Inversion of Goldreich's Function by Drunken Backtracking Algorithms

Dmitry Itsykson, 2010, CSR.

Almost Tight Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs

Danil Sagunov, Dmitry Itsykson, Artur Riazanov, 2019, Electron. Colloquium Comput. Complex..

Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas

Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson, 2004, SODA '04.

Heuristic Time Hierarchies via Hierarchies for Sampling Distributions

Alexander Knop, Dmitry Itsykson, Dmitry Sokolov, 2015, ISAAC.

On Tseitin formulas, read-once branching programs and treewidth

Dmitry Itsykson, Ludmila Glinskih, 2019, Electron. Colloquium Comput. Complex..

The Complexity of Inversion of Explicit Goldreich's Function by DPLL Algorithms

Dmitry Itsykson, Dmitry Sokolov, 2011, CSR.

Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs

Danil Sagunov, Dmitry Itsykson, Artur Riazanov, 2021, Comput. Complex..

Correction to: Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs

Danil Sagunov, Dmitry Itsykson, Artur Riazanov, 2021, Comput. Complex..

Computational and Proof Complexity of Partial String Avoidability

Alexander Okhotin, Dmitry Itsykson, Vsevolod Oparin, 2021, ACM Trans. Comput. Theory.

On Tseitin Formulas, Read-Once Branching Programs and Treewidth

Dmitry Itsykson, Ludmila Glinskih, 2021, Theory Comput. Syst..

Lower bounds on static Lovász-Schrijver calculus proofs for Tseitin tautologies

Arist Kojevnikov, Dmitry Itsykson, A. Kojevnikov, 2007 .

The complexity of inverting explicit Goldreich’s function by DPLL algorithms

Dmitry Sokolov, Dmitry Itsykson, 2013 .