A Constraint Satisfaction Approach for Programmable Logic Detailed Placement

DOI10.1007/978-3-642-39071-5_16zbMath1390.68604OpenAlexW1858858479MaRDI QIDQ5326465

Andrew Mihal, Steve Teig

Publication date: 5 August 2013

Published in: Theory and Applications of Satisfiability Testing – SAT 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39071-5_16

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Recognition of Nested Gates in CNF Formulas

Uses Software

• Chaff
• Lynx

This page was built for publication: A Constraint Satisfaction Approach for Programmable Logic Detailed Placement