A Comparative Study of Two Boolean Formulations of FPGA Detailed Routing Constraints

Abstract--This paper presents empirical analyses of two Boolean Satisfiability (SAT) formulations of FPGA (Field Programmable Gate Array) detailed routing constraints. Boolean SAT-based routing tra...