Publisher
Springer Science and Business Media LLC
Reference23 articles.
1. Shannon C E. A mathematical theory of communication. Bell Syst Tech J, 1948, 27:379–423
2. Creignou N, Khanna S, Sudan M. Complexity Classifications of Boolean Constraint Satisfaction Problems. In: Monographs on Discrete Mathematics and Applications, Vol. 7. SIAM, 2001
3. Hell P, Nesetril J. Graphs and Homomorphisms. Oxford University Press, 2004
4. Cheeseman P, Kanefsky B, Taylor W M. Where the really hard problems are. In: Proceedings of IJCAI-91, Sydney, 1991. 331–337
5. Kaporis A C, Kirousis L M, Lalas E G. The probabilistic analysis of a greedy satisfiability algorithm. Random Struct Algor, 2006, 28:444–480
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献