On Tseitin Formulas, Read-Once Branching Programs and Treewidth von Glinskih, Ludmila, Itsykson, Dmitry

Volltext

Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs von Itsykson, Dmitry, Riazanov, Artur, Sagunov, Danil, Smirnov, Petr

Volltext

Correction to: Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs von Itsykson, Dmitry, Riazanov, Artur, Sagunov, Danil, Smirnov, Petr

Volltext

Resolution over linear equations modulo two von Itsykson, Dmitry, Sokolov, Dmitry

Volltext

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

Volltext

ON OBDD-BASED ALGORITHMS AND PROOF SYSTEMS THAT DYNAMICALLY CHANGE THE ORDER OF VARIABLES von ITSYKSON, DMITRY, KNOP, ALEXANDER, ROMASHCHENKO, ANDREI, SOKOLOV, DMITRY

Volltext

Bounded-depth Frege complexity of Tseitin formulas for all graphs von Galesi, Nicola, Itsykson, Dmitry, Riazanov, Artur, Sofronova, Anastasia

Volltext

Lower Bounds on OBDD Proofs with Several Orders von Buss, Sam, Itsykson, Dmitry, Knop, Alexander, Riazanov, Artur, Sokolov, Dmitry

Volltext

Computational and Proof Complexity of Partial String Avoidability von Itsykson, Dmitry, Okhotin, Alexander, Oparin, Vsevolod

Volltext

Structural complexity of AvgBPP von Itsykson, Dmitry

Volltext

On Tseitin Formulas, Read-Once Branching Programs and Treewidth von Glinskih, Ludmila, Itsykson, Dmitry

Volltext

Lower Bounds for Splittings by Linear Combinations von Itsykson, Dmitry, Sokolov, Dmitry

Volltext

Hard Satisfiable Formulas for Splittings by Linear Combinations von Itsykson, Dmitry, Knop, Alexander

Volltext

Structural Complexity of AvgBPP von Itsykson, Dmitry

Volltext

Lower Bounds for Myopic DPLL Algorithms with a Cut Heuristic von Itsykson, Dmitry, Sokolov, Dmitry

Volltext

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

Volltext

On an optimal randomized acceptor for graph nonisomorphism von Hirsch, Edward A., Itsykson, Dmitry

Volltext

Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies von Kojevnikov, Arist, Itsykson, Dmitry

Volltext

Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas von Alekhnovich, Michael, Hirsch, Edward A, Itsykson, Dmitry

Volltext

Graph Expansion, Tseitin Formulas and Resolution Proofs for CSP von Itsykson, Dmitry, Oparin, Vsevolod

Volltext