AC0 (French Wikipedia)

Analysis of information sources in references of the Wikipedia article "AC0" in French language version.

Last modified: 11:23:31, 4 September 2024 (UTC)

Ref.Un. Ref.Website

Global rank French rank

33doi.org

2^nd place

3^rd place

21univ-paris-diderot.fr

low place

2,481^st place

11au.dk

6,515^th place

9,067^th place

11issn.org

33^rd place

4^th place

11zbmath.org

2,089^th place

4,345^th place

11rutgers.edu

2,011^th place

2,581^st place

11ernet.in

5,708^th place

low place

11sciencedirect.com

137^th place

99^th place

11umass.edu

3,436^th place

5,790^th place

au.dk (Global: 6,515^th place; French: 9,067^th place)

cs.au.dk

(en) « Cours de Kristoffer Arnsfelt Hansen sur AC », sur Site de Kristoffer Arnsfelt Hansen à l'université Aarhus (Danemark), p. 2

doi.org (Global: 2^nd place; French: 3^rd place)

dx.doi.org

Merrick Furst, James B. Saxe et Michael Sipser, « Parity, circuits, and the polynomial-time hierarchy », Math. Syst. Theory, vol. 17,‎ 1984, p. 13-27 (ISSN 0025-5661, DOI 10.1007/bf01744431, zbMATH 0534.94008)
Johan Håstad, « Almost Optimal Lower Bounds for Small Depth Circuits », dans Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing, May 28-30, 1986, Berkeley, California, {USA}, 1986 (DOI 10.1145/12130.12132), p. 6-20
Eric Allender, Michael Saks et Igor Shparlinski, « A Lower Bound for Primality », Journal of Computer and System Sciences, vol. 62,‎ 1^er mars 2001, p. 356–366 (DOI 10.1006/jcss.2000.1725, lire en ligne, consulté le 28 juin 2016)

ernet.in (Global: 5,708^th place; French: low place)

drona.csa.iisc.ernet.in

(en) « Lecture 5 on AC0 and TC0 »

issn.org (Global: 33^rd place; French: 4^th place)

portal.issn.org

Merrick Furst, James B. Saxe et Michael Sipser, « Parity, circuits, and the polynomial-time hierarchy », Math. Syst. Theory, vol. 17,‎ 1984, p. 13-27 (ISSN 0025-5661, DOI 10.1007/bf01744431, zbMATH 0534.94008)

rutgers.edu (Global: 2,011^th place; French: 2,581^st place)

sites.math.rutgers.edu

(en) « Lecture 3: AC0, the switching lemma »

sciencedirect.com (Global: 137^th place; French: 99^th place)

Eric Allender, Michael Saks et Igor Shparlinski, « A Lower Bound for Primality », Journal of Computer and System Sciences, vol. 62,‎ 1^er mars 2001, p. 356–366 (DOI 10.1006/jcss.2000.1725, lire en ligne, consulté le 28 juin 2016)

umass.edu (Global: 3,436^th place; French: 5,790^th place)

people.cs.umass.edu

(en) Neil Immerman, Descriptive Complexity, New York, Springer-Verlag, 1999, 268 p. (ISBN 0-387-98600-6, présentation en ligne).

univ-paris-diderot.fr (Global: low place; French: 2,481^st place)

liafa.univ-paris-diderot.fr

Sylvain Perifel, Complexité algorithmique, Ellipses, 2014, 432 p. (ISBN 9782729886929, lire en ligne), chap. 5 (« Uniformité et non-uniformité »)

zbmath.org (Global: 2,089^th place; French: 4,345^th place)

Merrick Furst, James B. Saxe et Michael Sipser, « Parity, circuits, and the polynomial-time hierarchy », Math. Syst. Theory, vol. 17,‎ 1984, p. 13-27 (ISSN 0025-5661, DOI 10.1007/bf01744431, zbMATH 0534.94008)

AC0 (French Wikipedia)

au.dk (Global: 6,515th place; French: 9,067th place)

cs.au.dk

doi.org (Global: 2nd place; French: 3rd place)

dx.doi.org

ernet.in (Global: 5,708th place; French: low place)