True quantified Boolean formula (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "True quantified Boolean formula" in English language version.

refsWebsite

Global rank English rank

10doi.org

2^nd place

5semanticscholar.org

11^th place

8^th place

2qbflib.org

low place

2github.com

383^rd place

320^th place

1beyondnp.org

low place

1berkeley.edu

580^th place

462^nd place

1web.archive.org

1^st place

1florianlonsing.com

low place

1lonsing.github.io

low place

1skizzo.site

low place

1jku.at

low place

1bc.edu

4,784^th place

3,078^th place

1researchgate.net

120^th place

125^th place

1ucsd.edu

1,933^rd place

1,342^nd place

1arxiv.org

69^th place

59^th place

1siam.org

low place

6,473^rd place

1worldcat.org

5^th place

arxiv.org

Chen, Hubie (December 2009). "A Rendezvous of Logic, Complexity, and Algebra". ACM Computing Surveys. 42 (1). ACM: 1–32. arXiv:cs/0611018. doi:10.1145/1592451.1592453. S2CID 11975818.

bc.edu

Shen, Zhihe. Using QBF Solvers to Solve Games and Puzzles (PDF) (Thesis). Boston College.

berkeley.edu

people.eecs.berkeley.edu

Balabanov, Valeriy; Roland Jiang, Jie-Hong; Scholl, Christoph; Mishchenko, Alan; K. Brayton, Robert (2016). "2QBF: Challenges and Solutions" (PDF). International Conference on Theory and Applications of Satisfiability Testing: 453–459. Archived (PDF) from the original on 13 February 2021 – via SpringerLink.

beyondnp.org

"QBF Solvers | Beyond NP". beyondnp.org. Retrieved 2021-02-13.

doi.org

A. Chandra, D. Kozen, and L. Stockmeyer (1981). "Alternation". Journal of the ACM. 28 (1): 114–133. doi:10.1145/322234.322243. S2CID 238863413.{{cite journal}}: CS1 maint: multiple names: authors list (link)
Adi Shamir (1992). "Ip = Pspace". Journal of the ACM. 39 (4): 869–877. doi:10.1145/146585.146609. S2CID 315182.
Arora, Sanjeev; Barak, Boaz (2009), "Space complexity", Computational Complexity, Cambridge: Cambridge University Press, pp. 78–94, doi:10.1017/cbo9780511804090.007, ISBN 978-0-511-80409-0, S2CID 262800930, retrieved 2021-05-26
Shukla, Ankit; Biere, Armin; Seidl, Martina; Pulina, Luca (2019). A Survey on Applications of Quantified Boolean Formulas (PDF). 2019 IEEE 31st International Conference on Tools for Artificial Intelligence. pp. 78–84. doi:10.1109/ICTAI.2019.00020. Retrieved 29 May 2021.
Janota, Mikoláš; Marques-Silva, Joao (2011). On Deciding MUS Membership with QBF. Principles and Practice of Constraint Programming – CP 2011. Vol. 6876. pp. 414–428. doi:10.1007/978-3-642-23786-7_32. ISBN 978-3-642-23786-7.
Krom, Melven R. (1967). "The Decision Problem for a Class of First-Order Formulas in Which all Disjunctions are Binary". Zeitschrift für Mathematische Logik und Grundlagen der Mathematik. 13 (1–2): 15–20. doi:10.1002/malq.19670130104..
Aspvall, Bengt; Plass, Michael F.; Tarjan, Robert E. (1979). "A linear-time algorithm for testing the truth of certain quantified boolean formulas" (PDF). Information Processing Letters. 8 (3): 121–123. doi:10.1016/0020-0190(79)90002-4..
Chen, Hubie (December 2009). "A Rendezvous of Logic, Complexity, and Algebra". ACM Computing Surveys. 42 (1). ACM: 1–32. arXiv:cs/0611018. doi:10.1145/1592451.1592453. S2CID 11975818.
Lichtenstein, David (1982-05-01). "Planar Formulae and Their Uses". SIAM Journal on Computing. 11 (2): 329–343. doi:10.1137/0211025. ISSN 0097-5397. S2CID 207051487.

dx.doi.org

Arora, Sanjeev; Barak, Boaz (2009), "Space complexity", Computational Complexity, Cambridge: Cambridge University Press, pp. 78–94, doi:10.1017/cbo9780511804090.007, ISBN 978-0-511-80409-0, S2CID 262800930, retrieved 2021-05-26

florianlonsing.com

Lonsing, Florian (December 2017). "An Introduction to QBF Solving" (PDF). www.florianlonsing.com. Retrieved 29 May 2021.

github.com

Rabe, Markus N. (2021-04-15), MarkusRabe/cadet, retrieved 2021-05-06
Tentrup, Leander (2021-05-06), ltentrup/caqe, retrieved 2021-05-06

jku.at

fmv.jku.at

Shukla, Ankit; Biere, Armin; Seidl, Martina; Pulina, Luca (2019). A Survey on Applications of Quantified Boolean Formulas (PDF). 2019 IEEE 31st International Conference on Tools for Artificial Intelligence. pp. 78–84. doi:10.1109/ICTAI.2019.00020. Retrieved 29 May 2021.

lonsing.github.io

"DepQBF Solver". lonsing.github.io. Retrieved 2021-05-06.

qbflib.org

"QBFEVAL Home Page". www.qbflib.org. Retrieved 2021-02-13.
"QBFEVAL'20". www.qbflib.org. Retrieved 2021-05-29.

researchgate.net

Janota, Mikoláš; Marques-Silva, Joao (2011). On Deciding MUS Membership with QBF. Principles and Practice of Constraint Programming – CP 2011. Vol. 6876. pp. 414–428. doi:10.1007/978-3-642-23786-7_32. ISBN 978-3-642-23786-7.

semanticscholar.org

api.semanticscholar.org

A. Chandra, D. Kozen, and L. Stockmeyer (1981). "Alternation". Journal of the ACM. 28 (1): 114–133. doi:10.1145/322234.322243. S2CID 238863413.{{cite journal}}: CS1 maint: multiple names: authors list (link)
Adi Shamir (1992). "Ip = Pspace". Journal of the ACM. 39 (4): 869–877. doi:10.1145/146585.146609. S2CID 315182.
Arora, Sanjeev; Barak, Boaz (2009), "Space complexity", Computational Complexity, Cambridge: Cambridge University Press, pp. 78–94, doi:10.1017/cbo9780511804090.007, ISBN 978-0-511-80409-0, S2CID 262800930, retrieved 2021-05-26
Chen, Hubie (December 2009). "A Rendezvous of Logic, Complexity, and Algebra". ACM Computing Surveys. 42 (1). ACM: 1–32. arXiv:cs/0611018. doi:10.1145/1592451.1592453. S2CID 11975818.
Lichtenstein, David (1982-05-01). "Planar Formulae and Their Uses". SIAM Journal on Computing. 11 (2): 329–343. doi:10.1137/0211025. ISSN 0097-5397. S2CID 207051487.

siam.org

epubs.siam.org

Lichtenstein, David (1982-05-01). "Planar Formulae and Their Uses". SIAM Journal on Computing. 11 (2): 329–343. doi:10.1137/0211025. ISSN 0097-5397. S2CID 207051487.

skizzo.site

"sKizzo - a QBF solver". www.skizzo.site. Retrieved 2021-05-06.

ucsd.edu

math.ucsd.edu

Aspvall, Bengt; Plass, Michael F.; Tarjan, Robert E. (1979). "A linear-time algorithm for testing the truth of certain quantified boolean formulas" (PDF). Information Processing Letters. 8 (3): 121–123. doi:10.1016/0020-0190(79)90002-4..

web.archive.org

Balabanov, Valeriy; Roland Jiang, Jie-Hong; Scholl, Christoph; Mishchenko, Alan; K. Brayton, Robert (2016). "2QBF: Challenges and Solutions" (PDF). International Conference on Theory and Applications of Satisfiability Testing: 453–459. Archived (PDF) from the original on 13 February 2021 – via SpringerLink.

worldcat.org

Lichtenstein, David (1982-05-01). "Planar Formulae and Their Uses". SIAM Journal on Computing. 11 (2): 329–343. doi:10.1137/0211025. ISSN 0097-5397. S2CID 207051487.