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: Combinatorial Games for Tree-like Size and Space von Gryaznov, Svyatoslav, Ovcharov, Sergei, Riazanov, Artur

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

MCSP is Hard for Read-Once Nondeterministic Branching Programs von Glinskih, Ludmila, Riazanov, Artur

Volltext

Irreducible Subcube Partitions von Filmus, Yuval, Hirsch, Edward A., Kurz, Sascha, Ihringer, Ferdinand, Ryazanov, Artur, Smal, Alexander V., Vinyals, Marc

Volltext

On the Decision Trees with Symmetries von Riazanov, Artur

Volltext

Better Boosting of Communication Oracles, or Not von Harms, Nathaniel, Riazanov, Artur

Volltext bestellen

Partial Minimum Branching Program Size Problem is ETH-hard von Glinskih, Ludmila, Riazanov, Artur

Volltext bestellen

Resolution Over Linear Equations: Combinatorial Games for Tree-like Size and Space von Gryaznov, Svyatoslav, Ovcharov, Sergei, Riazanov, Artur

Volltext

Better Boosting of Communication Oracles, or Not von Harms, Nathaniel, Riazanov, Artur

Volltext

Partial Minimum Branching Program Size Problem is ETH-hard von Glinskih, Ludmila, Riazanov, Artur

Volltext

Sampling and Certifying Symmetric Functions von Filmus, Yuval, Leigh, Itai, Riazanov, Artur, Sokolov, Dmitry

Volltext bestellen

Top-Down Lower Bounds for Depth-Four Circuits von Göös, Mika, Riazanov, Artur, Sofronova, Anastasia, Sokolov, Dmitry

Volltext bestellen

Irreducible subcube partitions von Filmus, Yuval, Hirsch, Edward, Kurz, Sascha, Ihringer, Ferdinand, Riazanov, Artur, Smal, Alexander, Vinyals, Marc

Volltext

Proving Unsatisfiability with Hitting Formulas von Filmus, Yuval, Hirsch, Edward A, Riazanov, Artur, Smal, Alexander, Vinyals, Marc

Volltext bestellen

Sampling and Certifying Symmetric Functions von Filmus, Yuval, Leigh, Itai, Riazanov, Artur, Sokolov, Dmitry

Volltext

Top-Down Lower Bounds for Depth-Four Circuits von Göös, Mika, Riazanov, Artur, Sofronova, Anastasia, Sokolov, Dmitry

Volltext

Proving Unsatisfiability with Hitting Formulas von Filmus, Yuval, Hirsch, Edward A, Riazanov, Artur, Smal, Alexander, Vinyals, Marc

Volltext