EXPTIME (Polish Wikipedia)

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

Last modified: 22:25:00, 5 November 2020 (UTC)

Ref.Un. Ref.Website

Global rank Polish rank

2^nd place

5^th place

1,200^th place

1,358^th place

11books.google.com

3^rd place

42^nd place

acm.org (Global: 1,200^th place; Polish: 1,358^th place)

portal.acm.org

JurisJ. Hartmanis JurisJ., NeilN. Immerman NeilN., VivianV. Sewelson VivianV., Sparse Sets in NP−P: EXPTIME versus NEXPTIME, „Information and Control”, 65 (2/3), At ACM Digital Library, 1983, s. 382–391, DOI: 10.1145/800061.808769, ISBN 0-89791-099-0 .

books.google.com (Global: 3^rd place; Polish: 42^nd place)

Ding-ZhuD.Z. Du Ding-ZhuD.Z., Ker-IK.I. Ko Ker-IK.I., Theory of Computational Complexity, ISBN 978-1-118-59497-1 .

doi.org (Global: 2^nd place; Polish: 5^th place)

JurisJ. Hartmanis JurisJ., NeilN. Immerman NeilN., VivianV. Sewelson VivianV., Sparse Sets in NP−P: EXPTIME versus NEXPTIME, „Information and Control”, 65 (2/3), At ACM Digital Library, 1983, s. 382–391, DOI: 10.1145/800061.808769, ISBN 0-89791-099-0 .
Aviezri SA.S. Fraenkel Aviezri SA.S., DavidD. Lichtenstein DavidD., Computing a perfect strategy for n × n chess requires time exponential in n, „Journal of Combinatorial Theory, Series A”, 31 (2), 1981, s. 199–214, DOI: 10.1016/0097-3165(81)90016-9 .
J.M.J.M. Robson J.M.J.M., N by N Checkers is Exptime Complete, „SIAM Journal on Computing”, 13 (2), s. 252–267, DOI: 10.1137/0213018 .