Implicit computational complexity (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Implicit computational complexity" in English language version.

refsWebsite

Global rank English rank

2^nd place

1,871^st place

1,234^th place

6,599^th place

low place

304^th place

1,952^nd place

low place

11^th place

8^th place

doi.org

Girard, Jean-Yves; Scott, Philip; Andre, Scedrov (1992). "Bounded linear logic: a modular approach to polynomial-time computability". Theoretical Computer Science. 97 (1): 1–66. doi:10.1016/0304-3975(92)90386-T.
Jones, Neil D. (1999). "LOGSPACE and PTIME Characterized by Programming Languages". Theoretical Computer Science. 228 (1–2): 151–174. doi:10.1016/S0304-3975(98)00357-0.
Jones, Neil D. (2001). "The expressive power of higher-order types or, life without CONS". Journal of Functional Programming. 11 (1): 55–94. doi:10.1017/S0956796800003889.
Bellantoni, Stephen; Cook, Stephen (1992). "A new recursion-theoretic characterization of the polytime functions (Extended abstract)". Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92. pp. 283–293. doi:10.1145/129712.129740. ISBN 0897915119. S2CID 2215181.

Girard, Jean-Yves; Scott, Philip; Andre, Scedrov (1992). "Bounded linear logic: a modular approach to polynomial-time computability". Theoretical Computer Science. 97 (1): 1–66. doi:10.1016/0304-3975(92)90386-T.

Bellantoni, Stephen; Cook, Stephen (1992). "A new recursion-theoretic characterization of the polytime functions (Extended abstract)". Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92. pp. 283–293. doi:10.1145/129712.129740. ISBN 0897915119. S2CID 2215181.