A satisfiability algorithm and average-case hardness for formulas over the full binary basis.

Kazuhisa Seto Suguru Tamaki

Published in: Comput. Complex. (2013)

Keyphrases

average case
worst case
computational complexity
np hard
learning algorithm
dynamic programming
lower bound
uniform distribution
np complete
competitive ratio
objective function
special case
model selection
learning curves
worst case analysis