Abstract
From the SAT physical model, a physical hypothesis named PHHY is proposed. By PHHY, it is proved that there is a universally efficient algorithm for solving SAT problem. Then, by square packing problem, the authors show that there are interesting industrial NP-complete problems which can be solved through SAT algorithms, but each way of solving like this will be much worse than that of a certain direct solving.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Huang Wenqi, Li Wei, Lu Weifeng, Zhang Yuping. A physical model for the satisfiability problem. Lecture Notes in Computer Science 959 Springer. InProc. First Annual International Conference, Cocoon′95, Xi’an, China, August 1995.
Li Wei, Huang Wenqi. A mathematic-physical approach to the satisfiability problem. InScience in China, Series A, Nov. 1994 (in Chinese), Jan. 1995 (in English).
Huang Wenqi. Solving CNF-SAT problem by ordinary differential equation method. InProc. National Symposium on Dynamical System (in Chinese), Xinin, Black Horse River, July 1994.
Ker-I ko. Complexity Theory of Real Functions. Birchüser, Boston·Basel·Berlin, 1991.
Huang Wenqi, Moos Sweedler. A Practical, Feasible Square Packing Algorithm for Chip Manufacture in VLSI. Technical Report 1992-20, Mathematical Sciences Institute, Cornell University, U.S.A.
Author information
Authors and Affiliations
Additional information
Project supported by the Chinese High-Tech Program, the National Natural Science Foundation of China and the Chinese Science Foundation for Doctoral Training Program.
Huang Wenqi graduated from Department of Mathematics and Mechanics, Peking University in 1964. From 1981 to 1982, he worked as a visiting scholar at Mathematics Department, Cornell University. Currently, he is a Professor and the Director of Theoretical Computer Science Institute, Huazhong University of Science and Technology. He got the gold prize of the Third International Competition for Solving NP-Complete Problem SAT in 1996. His research interests includeP=? NP problem, practical algorithm for solving NP-hard problems.
Li Wei received his B.S. degree in mathematics from Peking University in 1966 and his Ph.D. degree in computer science from University of Edinburgh in 1983. Since 1986, he has been a Professor in computer science at Beijing University of Aeronautics and Astronautics. He has published over 90 papers which concern the areas of concurrent programming languages, operational semantics, type theory, and logical foundation of artificial intelligence.
Rights and permissions
About this article
Cite this article
Huang, W., Li, W. A hopeful CNF-SAT algorithm— Its high efficiency, industrial application and limitation. J. of Comput. Sci. & Technol. 13, 9–12 (1998). https://doi.org/10.1007/BF02946608
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02946608