AC0 (English Wikipedia)

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

Last modified: 17:49:26, 7 June 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

2^nd place

2^nd place

6^th place

6^th place

2,089^th place

1,141^st place

476^th place

340^th place

low place

low place

low place

low place

11web.archive.org

1^st place

1^st place

434^th place

249^th place

182^nd place

172^nd place

ams.org (Global: 434^th place; English: 249^th place)

mathscinet.ams.org

Furst, Merrick; Saxe, James B.; Sipser, Michael (1984). "Parity, circuits, and the polynomial-time hierarchy". Mathematical Systems Theory. 17 (1): 13–27. doi:10.1007/BF01744431. MR 0738749. Zbl 0534.94008.

archive.org (Global: 6^th place; English: 6^th place)

Arora, Sanjeev; Barak, Boaz (2009). Computational complexity. A modern approach. Cambridge University Press. pp. 117–118, 287. ISBN 978-0-521-42426-4. Zbl 1193.68112.
Immerman, N. (1999). Descriptive Complexity. Springer. p. 85.

clarkson.edu (Global: low place; English: low place)

people.clarkson.edu

Barrington, David Mix; Maciel, Alexis (July 18, 2000). "Lecture 2: The Complexity of Some Problems" (PDF). IAS/PCMI Summer Session 2000, Clay Mathematics Undergraduate Program: Basic Course on Computational Complexity.

doi.org (Global: 2^nd place; English: 2^nd place)

Furst, Merrick; Saxe, James B.; Sipser, Michael (1984). "Parity, circuits, and the polynomial-time hierarchy". Mathematical Systems Theory. 17 (1): 13–27. doi:10.1007/BF01744431. MR 0738749. Zbl 0534.94008.
Parberry, Ian; Garey, Michael R.; Meyer, Albert (1994-07-27). Circuit Complexity and Neural Networks. The MIT Press. doi:10.7551/mitpress/1836.001.0001. ISBN 978-0-262-28124-9.
Barrington, David A. Mix; Lu, Chi-Jen; Miltersen, Peter Bro; Skyum, Sven (1998). "Searching constant width mazes captures the AC0 hierarchy". In Morvan, Michel; Meinel, Christoph; Krob, Daniel (eds.). Stacs 98. Lecture Notes in Computer Science. Vol. 1373. Berlin, Heidelberg: Springer. pp. 73–83. doi:10.1007/BFb0028550. ISBN 978-3-540-69705-3.

iisc.ac.in (Global: low place; English: low place)

csa.iisc.ac.in

Kayal, Neeraj; Hegde, Sumant (2015). "Lecture 5: Feb 4, 2015" (PDF). E0 309: Topics in Complexity Theory. Archived (PDF) from the original on 2021-10-16. Retrieved 2021-10-16.

mit.edu (Global: 476^th place; English: 340^th place)

direct.mit.edu

Parberry, Ian; Garey, Michael R.; Meyer, Albert (1994-07-27). Circuit Complexity and Neural Networks. The MIT Press. doi:10.7551/mitpress/1836.001.0001. ISBN 978-0-262-28124-9.

springer.com (Global: 182^nd place; English: 172^nd place)

link.springer.com

Barrington, David A. Mix; Lu, Chi-Jen; Miltersen, Peter Bro; Skyum, Sven (1998). "Searching constant width mazes captures the AC0 hierarchy". In Morvan, Michel; Meinel, Christoph; Krob, Daniel (eds.). Stacs 98. Lecture Notes in Computer Science. Vol. 1373. Berlin, Heidelberg: Springer. pp. 73–83. doi:10.1007/BFb0028550. ISBN 978-3-540-69705-3.

web.archive.org (Global: 1^st place; English: 1^st place)

Kayal, Neeraj; Hegde, Sumant (2015). "Lecture 5: Feb 4, 2015" (PDF). E0 309: Topics in Complexity Theory. Archived (PDF) from the original on 2021-10-16. Retrieved 2021-10-16.

zbmath.org (Global: 2,089^th place; English: 1,141^st place)

Arora, Sanjeev; Barak, Boaz (2009). Computational complexity. A modern approach. Cambridge University Press. pp. 117–118, 287. ISBN 978-0-521-42426-4. Zbl 1193.68112.
Furst, Merrick; Saxe, James B.; Sipser, Michael (1984). "Parity, circuits, and the polynomial-time hierarchy". Mathematical Systems Theory. 17 (1): 13–27. doi:10.1007/BF01744431. MR 0738749. Zbl 0534.94008.