Login / Signup
A Comparison of Three Heuristics to Choose the Variable Ordering for Cylindrical Algebraic Decomposition.
Zongyan Huang
Matthew England
David J. Wilson
James H. Davenport
Lawrence C. Paulson
Published in:
ACM Commun. Comput. Algebra (2014)
Keyphrases
</>
variable ordering
branch and bound algorithm
conflict directed
strongly connected components
max sat
forward checking
propositional satisfiability
data mining
cellular automata
branch and bound
knowledge base
lower bound