Problema de satisfacibilitat booleana (Catalan Wikipedia)

Analysis of information sources in references of the Wikipedia article "Problema de satisfacibilitat booleana" in Catalan language version.

refsWebsite

Global rank Catalan rank

2^nd place

6^th place

5^th place

5^th place

274^th place

287^th place

1,185^th place

1,003^rd place

652^nd place

549^th place

acm.org

dl.acm.org

Cook, Stephen A. «The complexity of theorem-proving procedures». Proceedings of the 3rd Annual ACM Symposium on Theory of Computing. ACM, 03-05-1971, pàg. 151–158. DOI: 10.1145/800157.805047.

doi.org

dx.doi.org

Ohrimenko, Olga; Stuckey, Peter J.; Codish, Michael. Propagation = Lazy Clause Generation (en anglès). Berlin, Heidelberg: Springer Berlin Heidelberg, 2007-09-23, p. 544–558. DOI 10.1007/978-3-540-74970-7_39. ISBN 9783540749691.
Cook, Stephen A. «The complexity of theorem-proving procedures». Proceedings of the 3rd Annual ACM Symposium on Theory of Computing. ACM, 03-05-1971, pàg. 151–158. DOI: 10.1145/800157.805047.
Trakhtenbrot, B.A. «A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms» (en anglès). IEEE Annals of the History of Computing, 6, 4, 1984-10, pàg. 384–400. DOI: 10.1109/mahc.1984.10036. ISSN: 1058-6180.

ieee.org

ieeexplore.ieee.org

Trakhtenbrot, B.A. «A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms» (en anglès). IEEE Annals of the History of Computing, 6, 4, 1984-10, pàg. 384–400. DOI: 10.1109/mahc.1984.10036. ISSN: 1058-6180.

springer.com

link.springer.com

Ohrimenko, Olga; Stuckey, Peter J.; Codish, Michael. Propagation = Lazy Clause Generation (en anglès). Berlin, Heidelberg: Springer Berlin Heidelberg, 2007-09-23, p. 544–558. DOI 10.1007/978-3-540-74970-7_39. ISBN 9783540749691.

worldcat.org

Michael., Sipser,. Introduction to the theory of computation. 3a edició. Boston, MA: Cengage Learning, 2013. ISBN 9781133187790.
Trakhtenbrot, B.A. «A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms» (en anglès). IEEE Annals of the History of Computing, 6, 4, 1984-10, pàg. 384–400. DOI: 10.1109/mahc.1984.10036. ISSN: 1058-6180.