ACC0 (Italian Wikipedia)

Analysis of information sources in references of the Wikipedia article "ACC0" in Italian language version.

refsWebsite

Global rank Italian rank

2^nd place

7^th place

799^th place

22^nd place

1,564^th place

2,938^th place

741^st place

1,601^st place

1^st place

cmu.edu

Thérien (1981), Barrington & Thérien (1988) D. Thérien, Classification of finite monoids: The language approach, in Theoretical Computer Science, vol. 14, n. 2, 1981, 195–208, DOI:10.1016/0304-3975(81)90057-8. D.A. Barrington e D. Thérien, Finite monoids and the fine structure of NC¹, in Journal of the ACM, vol. 35, n. 4, 1988, 941–952, DOI:10.1145/48014.63138.
Razborov (1987), Smolensky (1987) A. A. Razborov, Lower bounds for the size of circuits of bounded depth with basis {⊕,∨}, in Math. notes of the Academy of Science of the USSR, vol. 41, n. 4, 1987, 333–338. R. Smolensky, Algebraic methods in the theory of lower bounds for Boolean circuit complexity, in Proc. 19th ACM Symposium on Theory of Computing, 1987, 77–82, DOI:10.1145/28395.28404.
Beigel & Tarui (1994) Richard Beigel e Jun Tarui, On ACC, in Computational Complexity, vol. 4, 1994, 350–366, DOI:10.1007/BF01263423.
Williams (2011). Ryan Williams, Non-uniform ACC Circuit Lower Bounds (PDF), in IEEE Conf. on Computational Complexity, 2011, 115–125, DOI:10.1109/CCC.2011.36.
Allender & Gore (1994) Eric Allender e Vivec Gore, A uniform circuit lower bound for the permanent (PDF), in SIAM Journal on Computing, vol. 23, n. 5, 1994, 1026–1049, DOI:10.1137/S0097539792233907. URL consultato il 21 marzo 2014 (archiviato dall'url originale il 3 marzo 2016).

Allender & Gore (1994) Eric Allender e Vivec Gore, A uniform circuit lower bound for the permanent (PDF), in SIAM Journal on Computing, vol. 23, n. 5, 1994, 1026–1049, DOI:10.1137/S0097539792233907. URL consultato il 21 marzo 2014 (archiviato dall'url originale il 3 marzo 2016).