Complexitat de circuits (Catalan Wikipedia)

Analysis of information sources in references of the Wikipedia article "Complexitat de circuits" in Catalan language version.

refsWebsite

Global rank Catalan rank

2^nd place

6^th place

5^th place

5^th place

274^th place

287^th place

1sciencedirect.com

149^th place

111^th place

1,185^th place

1,003^rd place

652^nd place

549^th place

acm.org

doi.acm.org

Santhanam, Rahul «Circuit Lower Bounds for Merlin-Arthur Classes». STOC 2007: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing. ACM [Nova York, NY, USA], 2007, pàg. 275–283. DOI: 10.1145/1250790.1250832.

doi.org

dx.doi.org

Allender, Eric «Circuit complexity before the dawn of the new millennium» (en anglès). Technical Report. Springer, Berlin, Heidelberg, 18-12-1996, pàg. 1–18. DOI: 10.1007/3-540-62034-6_33.
«A note on the circuit complexity of PP» (en anglès). Theoretical Computer Science, 347, 1-2, 30-11-2005, pàg. 415–418. DOI: 10.1016/j.tcs.2005.07.032. ISSN: 0304-3975.
Santhanam, Rahul «Circuit Lower Bounds for Merlin-Arthur Classes». STOC 2007: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing. ACM [Nova York, NY, USA], 2007, pàg. 275–283. DOI: 10.1145/1250790.1250832.
Williams, R. «Non-uniform ACC Circuit Lower Bounds». Proceedings of the 26th Annual IEEE Conference on Computational Complexity, 2011-6, pàg. 115–125. DOI: 10.1109/CCC.2011.36.

ieee.org

ieeexplore.ieee.org

Williams, R. «Non-uniform ACC Circuit Lower Bounds». Proceedings of the 26th Annual IEEE Conference on Computational Complexity, 2011-6, pàg. 115–125. DOI: 10.1109/CCC.2011.36.

sciencedirect.com

«A note on the circuit complexity of PP» (en anglès). Theoretical Computer Science, 347, 1-2, 30-11-2005, pàg. 415–418. DOI: 10.1016/j.tcs.2005.07.032. ISSN: 0304-3975.

springer.com

link.springer.com

Allender, Eric «Circuit complexity before the dawn of the new millennium» (en anglès). Technical Report. Springer, Berlin, Heidelberg, 18-12-1996, pàg. 1–18. DOI: 10.1007/3-540-62034-6_33.

worldcat.org

Michael., Sipser,. Introduction to the theory of computation. 3a edició. Boston, MA: Cengage Learning, 2013. ISBN 9781133187790.
«A note on the circuit complexity of PP» (en anglès). Theoretical Computer Science, 347, 1-2, 30-11-2005, pàg. 415–418. DOI: 10.1016/j.tcs.2005.07.032. ISSN: 0304-3975.