Login / Signup
A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis.
Kazuhisa Seto
Suguru Tamaki
Published in:
Computational Complexity Conference (2012)
Keyphrases
</>
average case
worst case
computational complexity
learning algorithm
optimal solution
dynamic programming
theoretical analysis
uniform distribution
worst case analysis
decision trees
objective function
np hard
competitive ratio
np complete