Descriptive complexity theory (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Descriptive complexity theory" in English language version.

Last modified: 15:25:01, 20 August 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

2114worldcat.org

4^th place

1210doi.org

2^nd place

32semanticscholar.org

15^th place

8^th place

11unirioja.es

990^th place

2,293^rd place

11dagstuhl.de

low place

dagstuhl.de (Global: low place; English: low place)

drops.dagstuhl.de

Grädel & Schalthöfer 2019. Grädel, Erich; Schalthöfer, Svenja (2019). Choiceless Logarithmic Space. Leibniz International Proceedings in Informatics (LIPIcs). Vol. 138. pp. 31:1–31:15. doi:10.4230/LIPICS.MFCS.2019.31. ISBN 9783959771177.

doi.org (Global: 2^nd place; English: 2^nd place)

Flum 2003. Flum, Joerg (2003). "Descriptive Complexity Theories" (PDF). Theoria: An International Journal for Theory, History and Foundations of Science. 18 (1): 47–58. doi:10.1387/theoria.409.
Mix Barrington, Immerman & Straubing 1990. Mix Barrington, David A.; Immerman, Neil; Straubing, Howard (December 1990). "On uniformity within NC1". Journal of Computer and System Sciences. 41 (3): 274–306. doi:10.1016/0022-0000(90)90022-D.
Grädel & Schalthöfer 2019. Grädel, Erich; Schalthöfer, Svenja (2019). Choiceless Logarithmic Space. Leibniz International Proceedings in Informatics (LIPIcs). Vol. 138. pp. 31:1–31:15. doi:10.4230/LIPICS.MFCS.2019.31. ISBN 9783959771177.
Abiteboul, Vardi & Vianu 1997. Abiteboul, Serge; Vardi, Moshe Y.; Vianu, Victor (15 January 1997). "Fixpoint logics, relational machines, and computational complexity". Journal of the ACM. 44 (1): 30–56. doi:10.1145/256292.256295. ISSN 0004-5411. S2CID 11338470.
Hella & Turull-Torres 2006. Hella, Lauri; Turull-Torres, José María (2006). "Computing queries with higher-order logics". Theoretical Computer Science. 355 (2). Essex, UK: Elsevier Science Publishers Ltd.: 197–214. doi:10.1016/j.tcs.2006.01.009. ISSN 0304-3975.
Immerman 1988. Immerman, Neil (1988). "Nondeterministic Space is Closed under Complementation". SIAM Journal on Computing. 17 (5): 935–938. doi:10.1137/0217058. ISSN 0097-5397.
Immerman 1986. Immerman, Neil (1986). "Relational queries computable in polynomial time". Information and Control. 68 (1–3): 86–104. doi:10.1016/s0019-9958(86)80029-8.
Vardi 1982. Vardi, Moshe Y. (1982). "The complexity of relational query languages (Extended Abstract)". Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82. New York, NY, USA: ACM. pp. 137–146. doi:10.1145/800070.802186. ISBN 978-0897910705. S2CID 7869248.
Grädel 1992. Grädel, Erich (13 July 1992). "Capturing complexity classes by fragments of second-order logic". Theoretical Computer Science. 101 (1): 35–57. doi:10.1016/0304-3975(92)90149-A. ISSN 0304-3975.
Harel & Peleg 1984. Harel, D.; Peleg, D. (1 January 1984). "On static logics, dynamic logics, and complexity classes". Information and Control. 60 (1): 86–102. doi:10.1016/S0019-9958(84)80023-6. ISSN 0019-9958.

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.org

Abiteboul, Vardi & Vianu 1997. Abiteboul, Serge; Vardi, Moshe Y.; Vianu, Victor (15 January 1997). "Fixpoint logics, relational machines, and computational complexity". Journal of the ACM. 44 (1): 30–56. doi:10.1145/256292.256295. ISSN 0004-5411. S2CID 11338470.
Vardi 1982. Vardi, Moshe Y. (1982). "The complexity of relational query languages (Extended Abstract)". Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82. New York, NY, USA: ACM. pp. 137–146. doi:10.1145/800070.802186. ISBN 978-0897910705. S2CID 7869248.

unirioja.es (Global: 990^th place; English: 2,293^rd place)

dialnet.unirioja.es

Flum 2003. Flum, Joerg (2003). "Descriptive Complexity Theories" (PDF). Theoria: An International Journal for Theory, History and Foundations of Science. 18 (1): 47–58. doi:10.1387/theoria.409.

worldcat.org (Global: 4^th place; English: 4^th place)

search.worldcat.org

Immerman 1999, p. 86. Immerman, Neil (1999). Descriptive complexity. Springer. ISBN 0-387-98600-6. OCLC 901297152.
Immerman 1999, p. 242. Immerman, Neil (1999). Descriptive complexity. Springer. ISBN 0-387-98600-6. OCLC 901297152.
Immerman 1999, p. 243. Immerman, Neil (1999). Descriptive complexity. Springer. ISBN 0-387-98600-6. OCLC 901297152.
Abiteboul, Vardi & Vianu 1997. Abiteboul, Serge; Vardi, Moshe Y.; Vianu, Victor (15 January 1997). "Fixpoint logics, relational machines, and computational complexity". Journal of the ACM. 44 (1): 30–56. doi:10.1145/256292.256295. ISSN 0004-5411. S2CID 11338470.
Hella & Turull-Torres 2006. Hella, Lauri; Turull-Torres, José María (2006). "Computing queries with higher-order logics". Theoretical Computer Science. 355 (2). Essex, UK: Elsevier Science Publishers Ltd.: 197–214. doi:10.1016/j.tcs.2006.01.009. ISSN 0304-3975.
McNaughton 1971. McNaughton, Robert (1971). Counter-free automata. M.I.T. Press. ISBN 0-262-13076-9. OCLC 651199926.
Immerman 1999, p. 22. Immerman, Neil (1999). Descriptive complexity. Springer. ISBN 0-387-98600-6. OCLC 901297152.
Immerman 1988. Immerman, Neil (1988). "Nondeterministic Space is Closed under Complementation". SIAM Journal on Computing. 17 (5): 935–938. doi:10.1137/0217058. ISSN 0097-5397.
Immerman 1999, pp. 153–154. Immerman, Neil (1999). Descriptive complexity. Springer. ISBN 0-387-98600-6. OCLC 901297152.
Grädel 1992. Grädel, Erich (13 July 1992). "Capturing complexity classes by fragments of second-order logic". Theoretical Computer Science. 101 (1): 35–57. doi:10.1016/0304-3975(92)90149-A. ISSN 0304-3975.
Immerman 1999, p. 115. Immerman, Neil (1999). Descriptive complexity. Springer. ISBN 0-387-98600-6. OCLC 901297152.
Immerman 1999, p. 121. Immerman, Neil (1999). Descriptive complexity. Springer. ISBN 0-387-98600-6. OCLC 901297152.
Immerman 1999, p. 181. Immerman, Neil (1999). Descriptive complexity. Springer. ISBN 0-387-98600-6. OCLC 901297152.
Harel & Peleg 1984. Harel, D.; Peleg, D. (1 January 1984). "On static logics, dynamic logics, and complexity classes". Information and Control. 60 (1): 86–102. doi:10.1016/S0019-9958(84)80023-6. ISSN 0019-9958.