Login / Signup
Tight Bound on Johnson's Algorithm for Maximum Satisfiability.
Jianer Chen
Donald K. Friesen
Hao Zheng
Published in:
J. Comput. Syst. Sci. (1999)
Keyphrases
</>
worst case
learning algorithm
computational complexity
upper bound
cost function
dynamic programming
optimal solution
search space
linear programming
randomly generated
lower bound
search strategy
space complexity
maximum satisfiability