Редукција полиномијалне временске сложености (Serbian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Редукција полиномијалне временске сложености" in Serbian language version.

refsWebsite

Global rank Serbian rank

2^nd place

4^th place

9,635^th place

low place

5^th place

12^th place

depaul.edu

Buss, S.R.; Hay, L. (1988), „On truth-table reducibility to SAT and the difference hierarchy over NP”, Proceedings of Third Annual Structure in Complexity Theory Conference, стр. 224—233, doi:10.1109/SCT.1988.5282
Aho, A. V. (2011), „Complexity theory”, Ур.: Blum, E. K.; Aho, A. V., Computer Science: The Hardware, Software and Heart of It, стр. 241—267, doi:10.1007/978-1-4614-1168-0_12 . See in particular pp. 255.
Schaefer, Marcus (2010), „Complexity of some geometric and topological problems” (PDF), Graph Drawing, 17th International Symposium, GS 2009, Chicago, IL, USA, September 2009, Revised Papers, Lecture Notes in Computer Science, 5849, Springer-Verlag, стр. 334—344, doi:10.1007/978-3-642-11805-0_32

Köbler, Johannes; Schöning, Uwe; Torán, Jacobo (1993), The Graph Isomorphism Problem: Its Structural Complexity, Birkhäuser, ISBN 978-0-8176-3680-7, OCLC 246882287