PolyL (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "PolyL" in English language version.

Last modified: 19:25:48, 10 October 2025 (UTC)

Ref.Un. Ref.Website

Global rank English rank

2^nd place

2^nd place

4^th place

4^th place

11complexityzoo.net

low place

low place

1,200^th place

821^st place

182^nd place

172^nd place

acm.org (Global: 1,200^th place; English: 821^st place)

dl.acm.org

Cook, Stephen A. (1979-04-30). "Deterministic CFL's are accepted simultaneously in polynomial time and log squared space". Proceedings of the eleventh annual ACM symposium on Theory of computing - STOC '79. New York, NY, USA: Association for Computing Machinery. pp. 338–345. doi:10.1145/800135.804426. ISBN 978-1-4503-7438-5.

complexityzoo.net (Global: low place; English: low place)

Complexity Zoo: polyL

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

Book, Ronald V. (1976-02-01). "Translational lemmas, polynomial time, and (log n)j-space". Theoretical Computer Science. 1 (3): 215–226. doi:10.1016/0304-3975(76)90057-8. ISSN 0304-3975.
Ferrarotti, Flavio; González, Senén; Schewe, Klaus-Dieter; Torres, José Maria Turull (2022), "Uniform polylogarithmic space completeness", Frontiers in Computer Science, 4 845990, doi:10.3389/FCOMP.2022.845990
Cook, Stephen A. (1979-04-30). "Deterministic CFL's are accepted simultaneously in polynomial time and log squared space". Proceedings of the eleventh annual ACM symposium on Theory of computing - STOC '79. New York, NY, USA: Association for Computing Machinery. pp. 338–345. doi:10.1145/800135.804426. ISBN 978-1-4503-7438-5.
Nisan, Noam (1994-03-01). "RL ⊆ SC". Computational Complexity. 4 (1): 1–11. doi:10.1007/BF01205052. ISSN 1420-8954.

springer.com (Global: 182^nd place; English: 172^nd place)

link.springer.com

Nisan, Noam (1994-03-01). "RL ⊆ SC". Computational Complexity. 4 (1): 1–11. doi:10.1007/BF01205052. ISSN 1420-8954.

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

search.worldcat.org

Book, Ronald V. (1976-02-01). "Translational lemmas, polynomial time, and (log n)j-space". Theoretical Computer Science. 1 (3): 215–226. doi:10.1016/0304-3975(76)90057-8. ISSN 0304-3975.
Nisan, Noam (1994-03-01). "RL ⊆ SC". Computational Complexity. 4 (1): 1–11. doi:10.1007/BF01205052. ISSN 1420-8954.