New heuristic to choose a cylindrical algebraic decomposition variable ordering motivated by complexity analysis.
Tereso del RíoMatthew EnglandPublished in: CoRR (2022)
Keyphrases
- variable ordering
- complexity analysis
- branch and bound algorithm
- lower bound
- conflict directed
- theoretical analysis
- strongly connected components
- forward checking
- max sat
- branch and bound
- computational complexity
- randomly generated
- upper bound
- binary decision diagrams
- first order logic
- propositional satisfiability
- optimal solution
- constraint satisfaction
- artificial intelligence
- optimization problems
- domain specific
- np hard
- data structure
- objective function