The Complexity of Inversion of Explicit Goldreich's Function by DPLL Algorithms. - Dmitry Itsykson; Dmitry Sokolov 001 (CSR, 2011)

Lower bounds for myopic DPLL algorithms with a cut heuristic. - Dmitry Itsykson; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2012)

Lower Bounds for Splittings by Linear Combinations. - Dmitry Itsykson; Dmitry Sokolov 001 (MFCS (2), 2014)

Tree-like resolution complexity of two planar problems. - Dmitry Itsykson; Anna Malova; Vsevolod Oparin; Dmitry Sokolov 001 (CoRR, 2014)

Heuristic time hierarchies via hierarchies for sampling distributions. - Dmitry Itsykson; Alexander Knop; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2014)

Resolution complexity of perfect mathcing principles for sparse graphs. - Dmitry Itsykson; Mikhail Slabodkin; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2014)

On Fast Heuristic Non-deterministic Algorithms and Short Heuristic Proofs. - Dmitry Itsykson; Dmitry Sokolov 001 (Fundam. Informaticae, 2014)

Resolution Complexity of Perfect Matching Principles for Sparse Graphs. - Dmitry Itsykson; Mikhail Slabodkin; Dmitry Sokolov 001 (CSR, 2015)

Complexity of distributions and average-case hardness. - Dmitry Itsykson; Alexander Knop; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2015)

On the probabilistic closure of the loose unambiguous hierarchy. - Edward A. Hirsch; Dmitry Sokolov 001 (Inf. Process. Lett., 2015)

Dag-like Communication and Its Applications. - Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2016)

Tight Lower Bounds on the Resolution Complexity of Perfect Matching Principles. - Dmitry Itsykson; Vsevolod Oparin; Mikhail Slabodkin; Dmitry Sokolov 001 (Fundam. Informaticae, 2016)

Monotone Circuit Lower Bounds from Resolution. - Ankit Garg; Mika Göös; Pritish Kamath; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2017)

Reordering Rule Makes OBDD Proof Systems Stronger. - Sam Buss; Dmitry Itsykson; Alexander Knop; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2018)

Adventures in Monotone Complexity and TFNP. - Mika Göös; Pritish Kamath; Robert Robere; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2018)

Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs. - Susanna F. de Rezende; Jakob Nordström; Kilian Risse; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2019)

Trade-Offs Between Size and Degree in Polynomial Calculus. - Guillaume Lagarde; Jakob Nordström; Dmitry Sokolov 001; Joseph Swernofsky (ITCS, 2020)

Resolution over linear equations modulo two. - Dmitry Itsykson; Dmitry Sokolov 001 (Ann. Pure Appl. Log., 2020)

Lower Bounds on OBDD Proofs with Several Orders. - Sam Buss; Dmitry Itsykson; Alexander Knop; Artur Riazanov; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2020)

Automating Algebraic Proof Systems is NP-Hard. - Mika Göös; Jakob Nordström; Toniann Pitassi; Robert Robere; Dmitry Sokolov 001; Susanna F. de Rezende (Electron. Colloquium Comput. Complex., 2020)

(Semi)Algebraic Proofs over ±1 Variables. - Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2020)

On OBDD-based Algorithms and Proof Systems that Dynamically Change the order of Variables. - Dmitry Itsykson; Alexander Knop; Andrei E. Romashchenko; Dmitry Sokolov 001 (J. Symb. Log., 2020)

The Power of Negative Reasoning. - Susanna F. de Rezende; Massimo Lauria; Jakob Nordström; Dmitry Sokolov 001 (CCC, 2021)

Branching Programs with Bounded Repetitions and Flow Formulas. - Anastasia Sofronova; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2021)

Pseudorandom Generators, Resolution and Heavy Width. - Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2021)

A Lower Bound for k-DNF Resolution on Random CNF Formulas via Expansion. - Anastasia Sofronova; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2022)

Random (log n)-CNF are Hard for Cutting Planes (Again). - Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2023)

Sampling and Certifying Symmetric Functions. - Yuval Filmus; Itai Leigh; Artur Riazanov; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2023)

Hardness Condensation by Restriction. - Mika Göös; Ilan Newman; Artur Riazanov; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2023)

Top-Down Lower Bounds for Depth-Four Circuits. - Mika Göös; Artur Riazanov; Anastasia Sofronova; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2023)

Supercritical Tradeoffs for Monotone Circuits. - Mika Göös; Gilbert Maystre; Kilian Risse; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2024)

A Lower Bound for k-DNF Resolution on Random CNF Formulas via Expansion. - Anastasia Sofronova; Dmitry Sokolov 001 (CCC, 2025)

Generalised Linial-Nisan Conjecture is False for DNFs. - Yaroslav Alekseev; Mika Göös; Ziyi Guan; Gilbert Maystre; Artur Riazanov; Dmitry Sokolov 001; Weiqiang Yuan 002 (Electron. Colloquium Comput. Complex., 2025)

Monotone Circuit Complexity of Matching. - Bruno Pasqualotto Cavalar; Mika Göös; Artur Riazanov; Anastasia Sofronova; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2025)

Sign-Rank of $k$-Hamming Distance is Constant. - Mika Göös; Nathaniel Harms; Valentin Imbach; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2025)

Searching for Falsified Clause in Random log{n}-CNFs is Hard for Randomized Communication. - Artur Riazanov; Anastasia Sofronova; Dmitry Sokolov 001; Weiqiang Yuan 002 (Electron. Colloquium Comput. Complex., 2025)

Lower Bounds Beyond DNF of Parities. - Artur Riazanov; Anastasia Sofronova; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2025)

Sign-Rank of k-Hamming Distance is Constant. - Mika Göös; Nathaniel Harms; Valentin Imbach; Dmitry Sokolov 001 (CoRR, 2025)