Login / Signup

Correction to: 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
  • np hard
  • objective function
  • semidefinite programming
  • high resolution
  • worst case
  • finite number
  • high dimensional
  • optimization problems
  • interior point methods