Login / Signup
Almost Tight Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs.
Dmitry Itsykson
Artur Riazanov
Danil Sagunov
Petr Smirnov
Published in:
Electron. Colloquium Comput. Complex. (2019)
Keyphrases
</>
lower bound
upper bound
semidefinite
worst case
np hard
optimal solution
objective function
high resolution
image classification
semidefinite programming
logical formulas