Author:
Zhang Jianmin,Shen Shengyu,Li Sikun
Publisher
Springer Science and Business Media LLC
Subject
Electrical and Electronic Engineering
Reference20 articles.
1. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. Proceedings of the 38th Design Automation Conference, Las Vegas, NV, USA, Jun. 18–22, 2001, 530–535.
2. N. Een and N. Sorensson. An extensible SAT-solver. Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing, Santa Margherita Ligure, Italy, May 5–8, 2003, 502–518.
3. C. H. Papadimitriou and D. Wolfe. The complexity of facets resolved. Journal of Computer and System Sciences, 37(1988)1, 2–13.
4. G. J. Nam, K. A. Sakallah, and R. A. Rutenbar. Satisfiability-based layout revisited: Detailed routing of complex FPGAs via search-based Boolean SAT. Proceedings of ACM/SIGDA Seventh International Symposium on Field Programmable Gate Arrays, Monterey, CA, USA, Feb. 21–22, 1999, 167–175.
5. G. J. Nam, F. Aloul, K. Sakallah, and R. Rutenbar. A comparative study of two Boolean formulations of FPGA detailed routing constraints. Proceedings of the 2001 International Symposium on Physical Design, Sonoma County, CA, USA, Apr. 1–4, 2001, 222–227.