L/Poly (Portuguese Wikipedia)

Analysis of information sources in references of the Wikipedia article "L/Poly" in Portuguese language version.

refsWebsite

Global rank Portuguese rank

2^nd place

4^th place

451^st place

981^st place

3^rd place

6^th place

ams.org

Aleliunas, Romas; Karp, Richard M.; Lipton, Richard J.; Lovász, László; Rackoff, Charles (1979), «Random walks, universal traversal sequences, and the complexity of maze problems», Proceedings of 20th Annual Symposium on Foundations of Computer Science, New York: IEEE, pp. 218–223, MR 598110, doi:10.1109/SFCS.1979.34
Reingold, Omer (2008), «Undirected connectivity in log-space», Journal of the ACM, 55 (4): 1–24, MR 2445014, doi:10.1145/1391289.1391291
Nisan, Noam (1993), «On read-once vs. multiple access to randomness in logspace», Theoretical Computer Science, 107 (1): 135–144, MR 1201169, doi:10.1016/0304-3975(93)90258-U .

Thierauf, Thomas (2000), The Computational Complexity of Equivalence and Isomorphism Problems, ISBN 978-3-540-41032-4, Lecture Notes in Computer Science, 1852, Springer-Verlag, p. 66

Cobham, Alan (1966), «The recognition problem for the set of perfect squares», Proceedings of the 7th Annual IEEE Symposium on Switching and Automata Theory (SWAT 1966), pp. 78–87, doi:10.1109/SWAT.1966.30
Aleliunas, Romas; Karp, Richard M.; Lipton, Richard J.; Lovász, László; Rackoff, Charles (1979), «Random walks, universal traversal sequences, and the complexity of maze problems», Proceedings of 20th Annual Symposium on Foundations of Computer Science, New York: IEEE, pp. 218–223, MR 598110, doi:10.1109/SFCS.1979.34
Reingold, Omer (2008), «Undirected connectivity in log-space», Journal of the ACM, 55 (4): 1–24, MR 2445014, doi:10.1145/1391289.1391291
Nisan, Noam (1993), «On read-once vs. multiple access to randomness in logspace», Theoretical Computer Science, 107 (1): 135–144, MR 1201169, doi:10.1016/0304-3975(93)90258-U .