Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference12 articles.
1. The effect of local constraints on the complexity of determination of the graph independence number;Alekseev,1982
2. Polynomial algorithm for finding the largest independent sets in graphs without forks;Alekseev;Discrete Appl. Math.,2004
3. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979
4. On the complexity of k-SAT;Impagliazzo;J. Comput. System Sci.,2001
5. Which problems have strongly exponential complexity?;Impagliazzo;J. Comput. System Sci.,2001
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献