Login / Signup
A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis.
Kazuhisa Seto
Suguru Tamaki
Published in:
Electron. Colloquium Comput. Complex. (2012)
Keyphrases
</>
average case
worst case
computational complexity
np hard
worst case analysis
objective function
dynamic programming
learning algorithm
theoretical analysis
average case complexity
optimal solution
high dimensional