SC (complexity) (English Wikipedia)

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

refsWebsite

Global rank English rank

2^nd place

low place

1,983^rd place

1,330^th place

69^th place

59^th place

11^th place

8^th place

arxiv.org (Global: 69^th place; English: 59^th place)

Chakraborty, Diptarka; Tewari, Raghunath (2018). "An $O(n^{\varepsilon })$ space and polynomial time algorithm for reachability in directed layered planar graphs". ACM Transactions on Computation Theory. 9 (4): 19:1–19:11. arXiv:1501.05828. doi:10.1145/3154857.

Chakraborty, Diptarka; Tewari, Raghunath (2018). "An $O(n^{\varepsilon })$ space and polynomial time algorithm for reachability in directed layered planar graphs". ACM Transactions on Computation Theory. 9 (4): 19:1–19:11. arXiv:1501.05828. doi:10.1145/3154857.
Nisan, Noam (1992), "RL ⊆ SC", Proceedings of the 24th ACM Symposium on Theory of computing (STOC '92), Victoria, British Columbia, Canada, pp. 619–623, doi:10.1145/129712.129772, S2CID 11651375{{citation}}: CS1 maint: location missing publisher (link).

Nisan, Noam (1992), "RL ⊆ SC", Proceedings of the 24th ACM Symposium on Theory of computing (STOC '92), Victoria, British Columbia, Canada, pp. 619–623, doi:10.1145/129712.129772, S2CID 11651375{{citation}}: CS1 maint: location missing publisher (link).