Login / Signup

Tight Bounds for Tseitin Formulas.

Dmitry ItsyksonArtur RiazanovPetr Smirnov
Published in: SAT (2022)
Keyphrases
  • tight bounds
  • semidefinite
  • upper bound
  • semidefinite programming
  • sufficient conditions
  • convex relaxation
  • interior point methods
  • machine learning
  • lower bound
  • evolutionary algorithm
  • higher dimensional