Класс NC (Russian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Класс NC" in Russian language version.

refsWebsite

Global rank Russian rank

2^nd place

3^rd place

5^th place

207^th place

1,021^st place

1^st place

low place

3,341^st place

5,277^th place

1,923^rd place

low place

doi.org

Cook, Stephen A. (1 января 1985). A taxonomy of problems with fast parallel algorithms. Information and Control. International Conference on Foundations of Computation Theory (англ.). 64 (1): 2–22. doi:10.1016/S0019-9958(85)80041-3. ISSN 0019-9958.
Pippenger, Nicholas (1979). On simultaneous resource bounds. 20th Annual Symposium on Foundations of Computer Science (SFCS 1979) (англ.): 307–311. doi:10.1109/SFCS.1979.29. ISSN 0272-5428.
S. Bellantoni and I. Oitavem (2004). Separating NC along the delta axis. Theoretical Computer Science. 318 (1–2): 57–78. doi:10.1016/j.tcs.2003.10.021.
Barrington, David A. (1989). Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC¹ (PDF). J. Comput. Syst. Sci. 38 (1): 150–164. doi:10.1016/0022-0000(89)90037-8. ISSN 0022-0000. Zbl 0667.68059.

Pippenger, Nicholas (1979). On simultaneous resource bounds. 20th Annual Symposium on Foundations of Computer Science (SFCS 1979) (англ.): 307–311. doi:10.1109/SFCS.1979.29. ISSN 0272-5428.

Cook, Stephen A. (1 января 1985). A taxonomy of problems with fast parallel algorithms. Information and Control. International Conference on Foundations of Computation Theory (англ.). 64 (1): 2–22. doi:10.1016/S0019-9958(85)80041-3. ISSN 0019-9958.
Pippenger, Nicholas (1979). On simultaneous resource bounds. 20th Annual Symposium on Foundations of Computer Science (SFCS 1979) (англ.): 307–311. doi:10.1109/SFCS.1979.29. ISSN 0272-5428.
Barrington, David A. (1989). Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC¹ (PDF). J. Comput. Syst. Sci. 38 (1): 150–164. doi:10.1016/0022-0000(89)90037-8. ISSN 0022-0000. Zbl 0667.68059.