Schaefer's dichotomy theorem (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Schaefer's dichotomy theorem" in English language version.

refsWebsite

Global rank English rank

2^nd place

69^th place

59^th place

11^th place

8^th place

5^th place

3,341^st place

2,191^st place

149^th place

178^th place

102^nd place

76^th place

arxiv.org

Chen, Hubie (December 2009). "A Rendezvous of Logic, Complexity, and Algebra". ACM Computing Surveys. 42 (1): 1–32. arXiv:cs/0611018. doi:10.1145/1592451.1592453. S2CID 11975818.
Chen, Hubie (December 2006). "A Rendezvous of Logic, Complexity, and Algebra". ACM SIGACT News. 37 (4): 85–114. arXiv:cs/0611018. doi:10.1145/1189056.1189076. S2CID 14130916.
Bodirsky, Manuel; Pinsker, Michael (2015). "Schaefer's Theorem for Graphs". J. ACM. 62 (3): 19:1–19:52. arXiv:1011.2894. doi:10.1145/2764899. S2CID 750401.

Schaefer, Thomas J. (1978). "The complexity of satisfiability problems". Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78. pp. 216–226. doi:10.1145/800133.804350.
Chen, Hubie (December 2009). "A Rendezvous of Logic, Complexity, and Algebra". ACM Computing Surveys. 42 (1): 1–32. arXiv:cs/0611018. doi:10.1145/1592451.1592453. S2CID 11975818.
Chen, Hubie (December 2006). "A Rendezvous of Logic, Complexity, and Algebra". ACM SIGACT News. 37 (4): 85–114. arXiv:cs/0611018. doi:10.1145/1189056.1189076. S2CID 14130916.
Allender, Eric; Bauland, Michael; Immerman, Neil; Schnoor, Henning; Vollmer, Heribert (June 2009). "The complexity of satisfiability problems: Refining Schaefer's theorem" (PDF). Journal of Computer and System Sciences. 75 (4): 245–254. doi:10.1016/j.jcss.2008.11.001. Retrieved 2013-09-19.
Bodirsky, Manuel; Pinsker, Michael (2015). "Schaefer's Theorem for Graphs". J. ACM. 62 (3): 19:1–19:52. arXiv:1011.2894. doi:10.1145/2764899. S2CID 750401.
Creignou, Nadia; Hermann, Miki (1996). "Complexity of generalized satisfiability counting problems". Information and Computation. 125 (1): 1–12. doi:10.1006/inco.1996.0016. ISSN 0890-5401.
Bulatov, Andrei A.; Dalmau, Víctor (1 May 2007). "Towards a dichotomy theorem for the counting constraint satisfaction problem". Information and Computation. 205 (5): 651–678. doi:10.1016/j.ic.2006.09.005. hdl:10230/36327. ISSN 0890-5401.

Chen, Hubie (December 2009). "A Rendezvous of Logic, Complexity, and Algebra". ACM Computing Surveys. 42 (1): 1–32. arXiv:cs/0611018. doi:10.1145/1592451.1592453. S2CID 11975818.
Chen, Hubie (December 2006). "A Rendezvous of Logic, Complexity, and Algebra". ACM SIGACT News. 37 (4): 85–114. arXiv:cs/0611018. doi:10.1145/1189056.1189076. S2CID 14130916.
Bodirsky, Manuel; Pinsker, Michael (2015). "Schaefer's Theorem for Graphs". J. ACM. 62 (3): 19:1–19:52. arXiv:1011.2894. doi:10.1145/2764899. S2CID 750401.