P (complexity) (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "P (complexity)" in English language version.

refsWebsite

Global rank English rank

8doi.org

2^nd place

1stackoverflow.com

4,643^rd place

2,973^rd place

1st-andrews.ac.uk

1,547^th place

1,410^th place

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

Cai & Sivakumar 1999. Cai, Jin-Yi; Sivakumar, D. (April 1999). "Sparse Hard Sets for P: Resolution of a Conjecture of Hartmanis". Journal of Computer and System Sciences. 58 (2): 280–296. doi:10.1006/jcss.1998.1615.
Vardi 1982. Vardi, Moshe Y. (1982). "The Complexity of Relational Query Languages". STOC '82: Proceedings of the fourteenth annual ACM symposium on Theory of computing. pp. 137–146. doi:10.1145/800070.802186.
Immerman 1982. Immerman, Neil (1982). "Relational Queries Computable in Polynomial Time". Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing (STOC '82). pp. 147–152. doi:10.1145/800070.802187. Revised version in Information and Control, 68 (1986), 86–104
Bellantoni & Cook 1992. Bellantoni, Stephen; Cook, Stephen A. (1992). "A new recursion-theoretic characterization of the polytime functions". Computational Complexity. 2: 97–110. doi:10.1007/BF01201998.
Wegener 2005, p. 35. Wegener, Ingo (2005). Complexity Theory | Exploring the Limits of Efficient Algorithms (Textbook). Springer-Verlag. doi:10.1007/3-540-27477-4. ISBN 978-3-540-21045-0.
Rabin 1967. Rabin, Michael O. (1967). "Mathematical theory of automata". Mathematical Aspects of Computer Science. Proceedings of Symposia in Applied Mathematics. Vol. 19. American Mathematical Society. pp. 153–175. doi:10.1090/psapm/019.
Edmonds 1965. Edmonds, Jack (1965). "Paths, Trees, and Flowers". Canadian Journal of Mathematics. 17 (3): 449–467. doi:10.4153/CJM-1965-045-4.
Cobham (1965) was mentioned in Cook (1971) Cobham, Alan (1965). "The Intrinsic Computational Difficulty of Functions". In Bar-Hillel, Yehoshua (ed.). Logic, Methodology and Philosophy of Science: Proceedings of the 1964 International Congress. Amsterdam: North-Holland. pp. 24–30. Cook, Stephen A. (1971). "The Complexity of Theorem-Proving Procedures". Proceedings of the Third Annual ACM Symposium on Theory of Computing. ACM. pp. 151–158. doi:10.1145/800157.805047.

st-andrews.ac.uk (Global: 1,547^th place; English: 1,410^th place)

mjn.host.cs.st-andrews.ac.uk

Kallmeyer (2010, pp. 5, 37), citing Bertsch & Nederhof (2001) for the proof. Kallmeyer, Laura (2010). Parsing Beyond Context-Free Grammars (PDF). Springer Science & Business Media. pp. 5, 37. ISBN 978-3-642-14846-0. Bertsch, Eberhard; Nederhof, Mark-Jan (October 2001). "On the Complexity of Some Extensions of RCG Parsing" (PDF). Proceedings of the Seventh International Workshop on Parsing Technologies (IWPT 2001). Beijing, China. pp. 66–77.

stackoverflow.com (Global: 4,643^rd place; English: 2,973^rd place)

StackOverflow. StackOverflow. "Complexity theory - Why is co-P = P". Stack Overflow. Retrieved 15 November 2025.

P (complexity) (English Wikipedia)

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

st-andrews.ac.uk (Global: 1,547th place; English: 1,410th place)

mjn.host.cs.st-andrews.ac.uk

stackoverflow.com (Global: 4,643rd place; English: 2,973rd place)

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

st-andrews.ac.uk (Global: 1,547^th place; English: 1,410^th place)

stackoverflow.com (Global: 4,643^rd place; English: 2,973^rd place)