On the Reasons for Average Superlinear Speedup in Parallel Backtrack Search.

Andreas Goerdt Udo Kamps

Published in: CSL (1993)

Keyphrases

backtrack search
constraint programming
constraint satisfaction problems
constraint satisfaction
orders of magnitude
sat solvers
highly efficient
branch and bound algorithm
low cost
propositional satisfiability