Login / Signup

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

Dmitry ItsyksonArtur RiazanovDanil SagunovPetr Smirnov
Published in: Comput. Complex. (2021)
Keyphrases
  • lower bound
  • semidefinite
  • upper bound
  • objective function
  • np hard
  • optimal solution
  • high resolution
  • special case
  • logical formulas
  • learning algorithm
  • worst case
  • linear programming
  • max sat