搜索资源列表
Garey---Computers-and-Intractability---A-Guide-to
- Garey - Computers and Intractability - A Guide to NP-Completene-Garey - Computers and Intractability - A Guide to NP-Completeness
3SAT-NP-Completeness
- Proff of the NP-Completeness of the 3-SAT problem
Computer.and.intractability.a.guide.to.the.theory
- Computer and Intractability a guide to the theory of NP completene-Computer and Intractability a guide to the theory of NP completeness
A-Guide-To-The-Theory-Of-NP-Completeness
- 深入理解NP完备问题:A Guide To The Theory Of NP-Completene-NP complete problem understanding: A Guide To The Theory Of NP-Completeness
C3113f09s1
- In general, proving NP-completeness of a language L by reduction consists of the following steps.
NP-complete
- 数论算法,NP-完全性不能在合理的时间内求得问题的解-Number theory algorithms, NP-completeness can not be obtained within a reasonable time solution of the problem