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

2^nd place

6,454^th place

4,437^th place

4,643^rd place

2,973^rd place

14^th place

1,547^th place

1,410^th place

archive.today

"complexity theory - Why is co-P = P". Stack Overflow. Archived from the original on 14 October 2020. Retrieved 2020-10-14.

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, 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, Neil (1982). "Relational Queries Computable in Polynomial Time". STOC '82: Proceedings of the fourteenth annual ACM symposium on Theory of computing. pp. 147–152. doi:10.1145/800070.802187. Revised version in Information and Control, 68 (1986), 86–104.
Wegener, Ingo (2005). Complexity Theory. Springer-Verlag. p. 35. 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: 449–467. doi:10.4153/CJM-1965-045-4.

Manindra Agrawal, Neeraj Kayal, Nitin Saxena, "PRIMES is in P", Annals of Mathematics 160 (2004), no. 2, pp. 781–793.

Laura Kallmeyer (2010). Parsing Beyond Context-Free Grammars. Springer Science & Business Media. pp. 5 and 37. ISBN 978-3-642-14846-0. citing http://mjn.host.cs.st-andrews.ac.uk/publications/2001d.pdf for the proof

"complexity theory - Why is co-P = P". Stack Overflow. Archived from the original on 14 October 2020. Retrieved 2020-10-14.