No. Title Author Year
1 Tight Bounds for Tseitin Formulas Itsykson, Dmitry et al. 2022
2 Proof Complexity of Natural Formulas via Communication Arguments Itsykson, Dmitry et al. 2021
3 Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs Galesi, Nicola et al. 2019
4 Reordering Rule Makes OBDD Proof Systems Stronger Buss, Sam et al. 2018
5 On OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of Variables Itsykson, Dmitry et al. 2017
6 Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs Glinskih, Ludmila et al. 2017
7 Complexity of Distributions and Average-Case Hardness Itsykson, Dmitry et al. 2016
8 Computational and Proof Complexity of Partial String Avoidability Itsykson, Dmitry et al. 2016
9 On Optimal Heuristic Randomized Semidecision Procedures, with Application to Proof Complexity Hirsch, Edward A. et al. 2010
Current Page :
Number of result pages: 1
Number of documents: 9


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI