EXPTIME (English Wikipedia)

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

Last modified: 15:00:42, 25 August 2025 (UTC)

Ref.Un. Ref.Website

Global rank English rank

2^nd place

2^nd place

4^th place

4^th place

1,200^th place

821^st place

11books.google.com

3^rd place

3^rd place

11sciencedirect.com

137^th place

146^th place

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

portal.acm.org

Juris Hartmanis, Neil Immerman, Vivian Sewelson. "Sparse Sets in NP−P: EXPTIME versus NEXPTIME". Information and Control, volume 65, issue 2/3, pp.158–181. 1985. At ACM Digital Library

dl.acm.org

Williams, Ryan (2011-10-14). "Guest column: a casual tour around a circuit complexity bound". ACM SIGACT News. 42 (3): 54–76. doi:10.1145/2034575.2034591. ISSN 0163-5700.

books.google.com (Global: 3^rd place; English: 3^rd place)

Du, Ding-Zhu; Ko, Ker-I (2014), Theory of Computational Complexity, Wiley Series in Discrete Mathematics and Optimization (2nd ed.), John Wiley & Sons, Proposition 3.30, ISBN 9781118594971.

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

Fraenkel, Aviezri; Lichtenstein, David (1981). "Computing a perfect strategy for n×n chess requires time exponential in n". Journal of Combinatorial Theory. Series A. 31 (2): 199–214. doi:10.1016/0097-3165(81)90016-9.
J. M. Robson (1984). "N by N checkers is Exptime complete". SIAM Journal on Computing. 13 (2): 252–267. doi:10.1137/0213018.
Papadimitriou, Christos H.; Yannakakis, Mihalis (1986-12-01). "A note on succinct representations of graphs". Information and Control. 71 (3): 181–185. doi:10.1016/S0019-9958(86)80009-2. ISSN 0019-9958.
Williams, Ryan (2011-10-14). "Guest column: a casual tour around a circuit complexity bound". ACM SIGACT News. 42 (3): 54–76. doi:10.1145/2034575.2034591. ISSN 0163-5700.

sciencedirect.com (Global: 137^th place; English: 146^th place)

Papadimitriou, Christos H.; Yannakakis, Mihalis (1986-12-01). "A note on succinct representations of graphs". Information and Control. 71 (3): 181–185. doi:10.1016/S0019-9958(86)80009-2. ISSN 0019-9958.

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

search.worldcat.org

Papadimitriou, Christos H.; Yannakakis, Mihalis (1986-12-01). "A note on succinct representations of graphs". Information and Control. 71 (3): 181–185. doi:10.1016/S0019-9958(86)80009-2. ISSN 0019-9958.
Williams, Ryan (2011-10-14). "Guest column: a casual tour around a circuit complexity bound". ACM SIGACT News. 42 (3): 54–76. doi:10.1145/2034575.2034591. ISSN 0163-5700.