Login / Signup
Average-Case Perfect Matching Lower Bounds from Hardness of Tseitin Formulas.
Per Austrin
Kilian Risse
Published in:
Electron. Colloquium Comput. Complex. (2021)
Keyphrases
</>
average case
worst case
lower bound
upper bound
vc dimension
average case complexity
worst case analysis
np hard
semidefinite
online algorithms
uniform distribution
computational complexity
approximation algorithms
objective function
semidefinite programming
sample complexity
np hardness