AN APPROXIMATELY FAST ALGORITHM FOR DECIDING THE VALIDITY OF DISJUNCTIVE NORMAL FORMS (DNFs)
宋恩民, 黄文奇 · 中国科学通报：英文版 · 1992
The NP-complete problems have been shown to be hard problems in the theory of computational complexity. They include many problems of great significance both in theory and in practice. If there is a fast (in the sense of polynomial time) algorithm for the dual problem of an NP-complete problem, then there are fast algorithms for all. But so far, there