2-EXPTIME (English Wikipedia)

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

refsWebsite

Global rank English rank

10doi.org

2^nd place

3worldcat.org

5^th place

2web.archive.org

1^st place

2jstor.org

26^th place

20^th place

1mit.edu

415^th place

327^th place

1psu.edu

207^th place

136^th place

1semanticscholar.org

11^th place

8^th place

1hermann-gruber.com

low place

1uni-muenchen.de

3,337^th place

3,444^th place

1springer.com

274^th place

309^th place

1arxiv.org

69^th place

59^th place

1uni-freiburg.de

5,792^nd place

9,376^th place

1acm.org

1,185^th place

840^th place

acm.org (Global: 1,185^th place; English: 840^th place)

dl.acm.org

Pnueli, A.; Rosner, R. (1989-01-03). "On the synthesis of a reactive module". Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '89. New York, NY, USA: Association for Computing Machinery. pp. 179–190. doi:10.1145/75277.75293. ISBN 978-0-89791-294-5.

arxiv.org (Global: 69^th place; English: 59^th place)

Schmitz, Sylvain (2016). "Implicational Relevance Logic Is 2-Exptime-Complete". The Journal of Symbolic Logic. 81 (2): 641–661. arXiv:1402.0705. doi:10.1017/jsl.2015.7. ISSN 0022-4812. JSTOR 43864316.

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

doi.org

Dubé, Thomas W. (August 1990). "The Structure of Polynomial Ideals and Gröbner Bases". SIAM Journal on Computing. 19 (4): 750–773. doi:10.1137/0219053.
Kapur, Deepak; Narendran, Paliath (1992), "Double-exponential complexity of computing a complete set of AC-unifiers", [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science, pp. 11–21, doi:10.1109/LICS.1992.185515, ISBN 0-8186-2735-2, S2CID 206437926.
Ben-Or, Michael; Kozen, Dexter; Reif, John (1986-04-01). "The complexity of elementary algebra and geometry". Journal of Computer and System Sciences. 32 (2): 251–264. doi:10.1016/0022-0000(86)90029-2. ISSN 0022-0000.
Gruber, Hermann; Holzer, Markus (2008). "Finite Automata, Digraph Connectivity, and Regular Expression Size" (PDF). Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP 2008). Vol. 5126. pp. 39–50. doi:10.1007/978-3-540-70583-3_4.
Johannsen, Jan; Lange, Martin (2003), "CTL⁺ is complete for double exponential time", in Baeten, Jos C. M.; Lenstra, Jan Karel; Parrow, Joachim; Woeginger, Gerhard J. (eds.), Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP 2003) (PDF), Lecture Notes in Computer Science, vol. 2719, Springer-Verlag, pp. 767–775, doi:10.1007/3-540-45061-0_60, ISBN 978-3-540-40493-4, archived from the original (PDF) on 2007-09-30, retrieved 2006-12-22.
Schewe, Sven (2008). "ATL* Satisfiability is 2EXPTIME-Complete". In Aceto, Luca; Damgård, Ivan; Goldberg, Leslie Ann; Halldórsson, Magnús M.; Ingólfsdóttir, Anna; Walukiewicz, Igor (eds.). Automata, Languages and Programming. Lecture Notes in Computer Science. Vol. 5126. Berlin, Heidelberg: Springer. pp. 373–385. doi:10.1007/978-3-540-70583-3_31. ISBN 978-3-540-70583-3.
Schmitz, Sylvain (2016). "Implicational Relevance Logic Is 2-Exptime-Complete". The Journal of Symbolic Logic. 81 (2): 641–661. arXiv:1402.0705. doi:10.1017/jsl.2015.7. ISSN 0022-4812. JSTOR 43864316.
Lange, Martin; Lutz, Carsten (2005). "2-Exptime Lower Bounds for Propositional Dynamic Logics with Intersection". The Journal of Symbolic Logic. 70 (4): 1072–1086. doi:10.2178/jsl/1129642115. ISSN 0022-4812. JSTOR 27588414.
Pnueli, A.; Rosner, R. (1989-01-03). "On the synthesis of a reactive module". Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '89. New York, NY, USA: Association for Computing Machinery. pp. 179–190. doi:10.1145/75277.75293. ISBN 978-0-89791-294-5.

dx.doi.org

Ben-Or, Michael; Kozen, Dexter; Reif, John (1986-04-01). "The complexity of elementary algebra and geometry". Journal of Computer and System Sciences. 32 (2): 251–264. doi:10.1016/0022-0000(86)90029-2. ISSN 0022-0000.

hermann-gruber.com (Global: low place; English: low place)

Gruber, Hermann; Holzer, Markus (2008). "Finite Automata, Digraph Connectivity, and Regular Expression Size" (PDF). Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP 2008). Vol. 5126. pp. 39–50. doi:10.1007/978-3-540-70583-3_4.

jstor.org (Global: 26^th place; English: 20^th place)

Schmitz, Sylvain (2016). "Implicational Relevance Logic Is 2-Exptime-Complete". The Journal of Symbolic Logic. 81 (2): 641–661. arXiv:1402.0705. doi:10.1017/jsl.2015.7. ISSN 0022-4812. JSTOR 43864316.
Lange, Martin; Lutz, Carsten (2005). "2-Exptime Lower Bounds for Propositional Dynamic Logics with Intersection". The Journal of Symbolic Logic. 70 (4): 1072–1086. doi:10.2178/jsl/1129642115. ISSN 0022-4812. JSTOR 27588414.

mit.edu (Global: 415^th place; English: 327^th place)

lcs.mit.edu

Fischer, M. J., and Michael O. Rabin, 1974, ""Super-Exponential Complexity of Presburger Arithmetic. Archived 2006-09-15 at the Wayback Machine" Proceedings of the SIAM-AMS Symposium in Applied Mathematics Vol. 7: 27–41

psu.edu (Global: 207^th place; English: 136^th place)

citeseer.ist.psu.edu

Kapur, Deepak; Narendran, Paliath (1992), "Double-exponential complexity of computing a complete set of AC-unifiers", [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science, pp. 11–21, doi:10.1109/LICS.1992.185515, ISBN 0-8186-2735-2, S2CID 206437926.

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

api.semanticscholar.org

Kapur, Deepak; Narendran, Paliath (1992), "Double-exponential complexity of computing a complete set of AC-unifiers", [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science, pp. 11–21, doi:10.1109/LICS.1992.185515, ISBN 0-8186-2735-2, S2CID 206437926.

springer.com (Global: 274^th place; English: 309^th place)

link.springer.com

Schewe, Sven (2008). "ATL* Satisfiability is 2EXPTIME-Complete". In Aceto, Luca; Damgård, Ivan; Goldberg, Leslie Ann; Halldórsson, Magnús M.; Ingólfsdóttir, Anna; Walukiewicz, Igor (eds.). Automata, Languages and Programming. Lecture Notes in Computer Science. Vol. 5126. Berlin, Heidelberg: Springer. pp. 373–385. doi:10.1007/978-3-540-70583-3_31. ISBN 978-3-540-70583-3.

uni-freiburg.de (Global: 5,792^nd place; English: 9,376^th place)

informatik.uni-freiburg.de

Jussi Rintanen (2004). "Complexity of Planning with Partial Observability" (PDF). Proceedings of International Conference on Automated Planning and Scheduling. AAAI Press: 345–354.

uni-muenchen.de (Global: 3,337^th place; English: 3,444^th place)

tcs.informatik.uni-muenchen.de

Johannsen, Jan; Lange, Martin (2003), "CTL⁺ is complete for double exponential time", in Baeten, Jos C. M.; Lenstra, Jan Karel; Parrow, Joachim; Woeginger, Gerhard J. (eds.), Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP 2003) (PDF), Lecture Notes in Computer Science, vol. 2719, Springer-Verlag, pp. 767–775, doi:10.1007/3-540-45061-0_60, ISBN 978-3-540-40493-4, archived from the original (PDF) on 2007-09-30, retrieved 2006-12-22.

web.archive.org (Global: 1^st place; English: 1^st place)

Fischer, M. J., and Michael O. Rabin, 1974, ""Super-Exponential Complexity of Presburger Arithmetic. Archived 2006-09-15 at the Wayback Machine" Proceedings of the SIAM-AMS Symposium in Applied Mathematics Vol. 7: 27–41
Johannsen, Jan; Lange, Martin (2003), "CTL⁺ is complete for double exponential time", in Baeten, Jos C. M.; Lenstra, Jan Karel; Parrow, Joachim; Woeginger, Gerhard J. (eds.), Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP 2003) (PDF), Lecture Notes in Computer Science, vol. 2719, Springer-Verlag, pp. 767–775, doi:10.1007/3-540-45061-0_60, ISBN 978-3-540-40493-4, archived from the original (PDF) on 2007-09-30, retrieved 2006-12-22.

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

search.worldcat.org

Ben-Or, Michael; Kozen, Dexter; Reif, John (1986-04-01). "The complexity of elementary algebra and geometry". Journal of Computer and System Sciences. 32 (2): 251–264. doi:10.1016/0022-0000(86)90029-2. ISSN 0022-0000.
Schmitz, Sylvain (2016). "Implicational Relevance Logic Is 2-Exptime-Complete". The Journal of Symbolic Logic. 81 (2): 641–661. arXiv:1402.0705. doi:10.1017/jsl.2015.7. ISSN 0022-4812. JSTOR 43864316.
Lange, Martin; Lutz, Carsten (2005). "2-Exptime Lower Bounds for Propositional Dynamic Logics with Intersection". The Journal of Symbolic Logic. 70 (4): 1072–1086. doi:10.2178/jsl/1129642115. ISSN 0022-4812. JSTOR 27588414.

2-EXPTIME (English Wikipedia)

acm.org (Global: 1,185th place; English: 840th place)

dl.acm.org

arxiv.org (Global: 69th place; English: 59th place)

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