Logikai kielégítési probléma (Hungarian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Logikai kielégítési probléma" in Hungarian language version.

refsWebsite

Global rank Hungarian rank

15doi.org

2^nd place

8^th place

3worldcat.org

5^th place

22^nd place

2web.archive.org

1^st place

2springer.com

274^th place

438^th place

1berkeley.edu

580^th place

467^th place

1toronto.edu

low place

1archive.org

6^th place

14^th place

1cwi.nl

low place

1neu.edu

low place

1books.google.com

3^rd place

28^th place

1acm.org

1,185^th place

2,600^th place

1researchgate.net

120^th place

344^th place

1uwaterloo.ca

3,153^rd place

1,945^th place

1princeton.edu

741^st place

1,451^st place

1illinois.edu

1,349^th place

3,182^nd place

1satcompetition.org

low place

acm.org

portal.acm.org

R. E. Bryant, S. M. German, and M. N. Velev, Microprocessor Verification Using Efficient Decision Procedures for a Logic of Equality with Uninterpreted Functions, in Analytic Tableaux and Related Methods, pp. 1–13, 1999.

archive.org

Alfred V. Aho. The Design and Analysis of Computer Algorithms. Addison-Wesley (1974). ISBN 9780201000290 ; here: Thm.10.4

berkeley.edu

cs.berkeley.edu

Karp, Richard M..szerk.: Raymond E. Miller: Reducibility Among Combinatorial Problems, Complexity of Computer Computations. New York: Plenum, 85–103. o. (1972). ISBN 0-306-30707-3. Hozzáférés ideje: 2020. május 7. Here: p.86

books.google.com

Moore, Cristopher (2011), The Nature of Computation, <https://books.google.com/books?id=z4zMiZyAE1kC&pg=PA366>.

cwi.nl

homepages.cwi.nl

Schöning, Uwe. A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems, Proc. 40th Ann. Symp. Foundations of Computer Science, 410–414. o.. DOI: 10.1109/SFFCS.1999.814612 (1999. október 1.). ISBN 0-7695-0409-4

doi.org

dx.doi.org

Ohrimenko, Olga; Stuckey, Peter J. & Codish, Michael, Principles and Practice of Constraint Programming – CP 2007, pp. 544–558, DOI 10.1007/978-3-540-74970-7_39.
Hong (2010. november 1.). „QED: Quick Error Detection tests for effective post-silicon validation”. 2010 IEEE International Test Conference, 1–10. o. DOI:10.1109/TEST.2010.5699215.
Massacci (2000. február 1.). „Logical Cryptanalysis as a SAT Problem” (angol nyelven). Journal of Automated Reasoning 24 (1), 165–203. o. DOI:10.1023/A:1006326723002. ISSN 1573-0670.
Mironov (2006. február 4.). „Applications of SAT Solvers to Cryptanalysis of Hash Functions” (angol nyelven). Theory and Applications of Satisfiability Testing - SAT 2006, Berlin, Heidelberg 4121, 102–115. o, Kiadó: Springer. DOI:10.1007/11814948_13.
Vizel (2015). „Boolean Satisfiability Solvers and Their Applications in Model Checking”. Proceedings of the IEEE 103 (11), 2021–2035. o. DOI:10.1109/JPROC.2015.2455034.
Cook (1971). „The Complexity of Theorem-Proving Procedures”. Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, 151–158. o. DOI:10.1145/800157.805047.
Schöning, Uwe. A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems, Proc. 40th Ann. Symp. Foundations of Computer Science, 410–414. o.. DOI: 10.1109/SFFCS.1999.814612 (1999. október 1.). ISBN 0-7695-0409-4
Bart Selman (1996). „Generating Hard Satisfiability Problems”. Artificial Intelligence 81 (1–2), 17–29. o. DOI:10.1016/0004-3702(95)00045-3.
Arkin (2018. december 11.). „Selecting and covering colored points” (angol nyelven). Discrete Applied Mathematics 250, 75–86. o. DOI:10.1016/j.dam.2018.05.011. ISSN 0166-218X.
Buning (1995). „Resolution for Quantified Boolean Formulas”. Information and Computation 117 (1), 12–18. o, Kiadó: Elsevier. DOI:10.1006/inco.1995.1025.
Blass (1982. október 1.). „On the unique satisfiability problem”. Information and Control 55 (1), 80–88. o. DOI:10.1016/S0019-9958(82)90439-9. ISSN 0019-9958.
Valiant (1986). „NP is as easy as detecting unique solutions”. Theoretical Computer Science 47, 85–93. o. DOI:10.1016/0304-3975(86)90135-0.
Buldas (2017. február 4.). „Simple Infeasibility Certificates for Attack Trees” (angol nyelven). Advances in Information and Computer Security 10418, 39–55. o, Kiadó: Springer International Publishing. DOI:10.1007/978-3-319-64200-0_3.
Gi-Joon Nam (2002). „A new FPGA detailed routing approach via search-based Boolean satisfiability”. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 21 (6), 674. o. [2016. március 15-i dátummal az eredetiből archiválva]. DOI:10.1109/TCAD.2002.1004311. (Hozzáférés: 2022. június 9.)

doi.org

Massacci (2000. február 1.). „Logical Cryptanalysis as a SAT Problem” (angol nyelven). Journal of Automated Reasoning 24 (1), 165–203. o. DOI:10.1023/A:1006326723002. ISSN 1573-0670.

illinois.edu

cs-rutenbar.web.engr.illinois.edu

Gi-Joon Nam (2002). „A new FPGA detailed routing approach via search-based Boolean satisfiability”. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 21 (6), 674. o. [2016. március 15-i dátummal az eredetiből archiválva]. DOI:10.1109/TCAD.2002.1004311. (Hozzáférés: 2022. június 9.)

neu.edu

ccs.neu.edu

(1978) „The complexity of satisfiability problems”.: 216–226.

princeton.edu

cs.princeton.edu

Valiant (1986). „NP is as easy as detecting unique solutions”. Theoretical Computer Science 47, 85–93. o. DOI:10.1016/0304-3975(86)90135-0.

researchgate.net

Alhazov (2003). „Solving a PSPACE-Complete Problem by Recognizing P Systems with Restricted Active Membranes”. Fundamenta Informaticae 58, 67–77. o. Here: Sect.3, Thm.3.1

satcompetition.org

The international SAT Competitions web page. (Hozzáférés: 2007. november 15.)

springer.com

link.springer.com

Mironov (2006. február 4.). „Applications of SAT Solvers to Cryptanalysis of Hash Functions” (angol nyelven). Theory and Applications of Satisfiability Testing - SAT 2006, Berlin, Heidelberg 4121, 102–115. o, Kiadó: Springer. DOI:10.1007/11814948_13.

springer.com

Kozen, Dexter C.. Supplementary Lecture F: Unique Satisfiability, Theory of Computation, Texts in Computer Science (angol nyelven). London: Springer-Verlag, 180. o. (2006. február 4.). ISBN 9781846282973

toronto.edu

cs.toronto.edu

Cook (1971). „The Complexity of Theorem-Proving Procedures”. Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, 151–158. o. DOI:10.1145/800157.805047.

uwaterloo.ca

complexityzoo.uwaterloo.ca

Complexity Zoo:U - Complexity Zoo. complexityzoo.uwaterloo.ca. [2019. július 9-i dátummal az eredetiből archiválva]. (Hozzáférés: 2019. december 5.)

web.archive.org

Complexity Zoo:U - Complexity Zoo. complexityzoo.uwaterloo.ca. [2019. július 9-i dátummal az eredetiből archiválva]. (Hozzáférés: 2019. december 5.)
Gi-Joon Nam (2002). „A new FPGA detailed routing approach via search-based Boolean satisfiability”. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 21 (6), 674. o. [2016. március 15-i dátummal az eredetiből archiválva]. DOI:10.1109/TCAD.2002.1004311. (Hozzáférés: 2022. június 9.)

worldcat.org

Massacci (2000. február 1.). „Logical Cryptanalysis as a SAT Problem” (angol nyelven). Journal of Automated Reasoning 24 (1), 165–203. o. DOI:10.1023/A:1006326723002. ISSN 1573-0670.
Arkin (2018. december 11.). „Selecting and covering colored points” (angol nyelven). Discrete Applied Mathematics 250, 75–86. o. DOI:10.1016/j.dam.2018.05.011. ISSN 0166-218X.
Blass (1982. október 1.). „On the unique satisfiability problem”. Information and Control 55 (1), 80–88. o. DOI:10.1016/S0019-9958(82)90439-9. ISSN 0019-9958.