A variety of routing algorithms have been developed and applied, among them the Boolean Satisfiability (SAT)-based routing algorithm and the geometric search routing algorithm are two most popular methods. However, they have different disadvantages.
许多布线算法已经被开发并获得应用,其中布尔可满足性(SAT)布线算法及几何查找布线算法是当前最为流行的两种。
参考来源 - 几种用于FPGA的新型有效混合布线算法This paper described the significance of All-solution Boolean satisfiability problem both in theoretical and practical aspect.
本文介绍了对可满足性问题求全解的理论及实践意义。
参考来源 - 对可满足性（SAT）问题求全解的算法研究及实现·2,447,543篇论文数据，部分数据来源于NoteExpress
The Boolean Satisfiability is one of the most fundamental problems in computer science and a variety of algorithms-including the well-known search-based SAT algorithms-have been proposed.
布尔可满足性是计算机科学中最基础的问题之一，已经出现了包括著名的基于查找的SAT算法在内的各种算法。
To emphasize the binary nature of this problem, it is frequently referred to as Boolean or propositional satisfiability.
强调二进制的性质这一问题，这是经常被称为布尔或命题满足。
应用推荐