Satisfiability-Based Layout Revisited: Detailed Routing of Complex FPGAs vis Search-Based Boolean SAT.
Gi-Joon NamKarem A. SakallahRob A. RutenbarPublished in: FPGA (1999)
Keyphrases
- search algorithm
- satisfiability problem
- stochastic local search
- search strategies
- sat problem
- search space
- phase transition
- real world
- satisfiability testing
- search strategy
- symmetry breaking
- davis putnam logemann loveland
- backtracking search
- conjunctive normal form
- boolean formula
- complex queries
- sat solvers
- propositional satisfiability
- propositional logic
- sat solving
- routing algorithm
- computational complexity
- boolean satisfiability
- query routing
- boolean functions
- hierarchically organized
- shortest path