P (сложеност) (Serbian Wikipedia)

Analysis of information sources in references of the Wikipedia article "P (сложеност)" in Serbian language version.

refsWebsite

Global rank Serbian rank

6,454^th place

low place

5^th place

12^th place

207^th place

370^th place

1web.archive.org

1^st place

1^st place

2^nd place

4^th place

6^th place

5^th place

archive.org

Kozen 2006, стр. 4. Kozen, Dexter C. (2006). Theory of Computation. Springer. стр. 4. ISBN 978-1-84628-297-3.

doi.org

Immerman, Neil (1982). „Relational Queries Computable in Polynomial Time”. STOC '82: Proceedings of the fourteenth annual ACM symposium on Theory of computing. стр. 147—152. doi:10.1145/800070.802187. Revised version in Information and Control, 68 (1986), 86–104.

iitk.ac.in

cse.iitk.ac.in

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

psu.edu

citeseer.ist.psu.edu

Jin-Yi Cai and D. Sivakumar. Sparse hard sets for P: resolution of a conjecture of Hartmanis. Journal of Computer and System Sciences, volume 58, issue 2. стр. 280-296. 1999. ISSN 0022-0000. At Citeseer Архивирано на сајту Wayback Machine (9. новембар 2007)

web.archive.org

Jin-Yi Cai and D. Sivakumar. Sparse hard sets for P: resolution of a conjecture of Hartmanis. Journal of Computer and System Sciences, volume 58, issue 2. стр. 280-296. 1999. ISSN 0022-0000. At Citeseer Архивирано на сајту Wayback Machine (9. новембар 2007)

worldcat.org

Jin-Yi Cai and D. Sivakumar. Sparse hard sets for P: resolution of a conjecture of Hartmanis. Journal of Computer and System Sciences, volume 58, issue 2. стр. 280-296. 1999. ISSN 0022-0000. At Citeseer Архивирано на сајту Wayback Machine (9. новембар 2007)