Complexidade de circuitos (Portuguese Wikipedia)

Analysis of information sources in references of the Wikipedia article "Complexidade de circuitos" in Portuguese language version.

refsWebsite

Global rank Portuguese rank

2^nd place

4^th place

5^th place

5^th place

1,923^rd place

low place

207^th place

589^th place

179^th place

198^th place

doi.org

dx.doi.org

Furst, Merrick; Saxe, James B.; Sipser, Michael (1984). «Parity, circuits, and the polynomial-time hierarchy». Math. Syst. Theory. 17: 13–27. ISSN 0025-5661. Zbl 0534.94008. doi:10.1007/bf01744431
Santhanam, Rahul (2007). «Circuit lower bounds for Merlin-Arthur classes». STOC 2007: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing. pp. 275–283. doi:10.1145/1250790.1250832
Williams, Ryan (2011). «Non-Uniform ACC Circuit Lower Bounds» (PDF). CCC 2011: Proceedings of the 26th Annual IEEE Conference on Computational Complexity. pp. 115–125. doi:10.1109/CCC.2011.36
Kabanets, V.; Impagliazzo, R. (2004). «Derandomizing polynomial identity tests means proving circuit lower bounds». Computational Complexity. 13 (1): 1–46. doi:10.1007/s00037-004-0182-6

psu.edu

citeseer.ist.psu.edu

Santhanam, Rahul (2007). «Circuit lower bounds for Merlin-Arthur classes». STOC 2007: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing. pp. 275–283. doi:10.1145/1250790.1250832

stanford.edu

Williams, Ryan (2011). «Non-Uniform ACC Circuit Lower Bounds» (PDF). CCC 2011: Proceedings of the 26th Annual IEEE Conference on Computational Complexity. pp. 115–125. doi:10.1109/CCC.2011.36

worldcat.org

Furst, Merrick; Saxe, James B.; Sipser, Michael (1984). «Parity, circuits, and the polynomial-time hierarchy». Math. Syst. Theory. 17: 13–27. ISSN 0025-5661. Zbl 0534.94008. doi:10.1007/bf01744431

zbmath.org

Furst, Merrick; Saxe, James B.; Sipser, Michael (1984). «Parity, circuits, and the polynomial-time hierarchy». Math. Syst. Theory. 17: 13–27. ISSN 0025-5661. Zbl 0534.94008. doi:10.1007/bf01744431