An On-Line Satisfiability Algorithm for Conjunctive Normal Form Expressions with Two Literals.

Published in: FLAIRS Conference (2002)

Keyphrases

computational complexity
np hard
objective function
np complete
learning algorithm
optimal solution
special case
upper bound
simulated annealing
randomly generated