On TC0, AC0, and Arithmetic Circuits

An Introduction to the Theory of Numbers. By G. H. Hardy and E. M. Wright. 2nd edition. Pp. xvi, 407 25s. 1945. (Oxford)

T. A. A. B. · The Mathematical Gazette · 1946 · 7.4K citations

Natural Sciences, Mathematics, Number Theory +3

An introduction to the theory of numbers

Journal of the Franklin Institute · 1960 · 3.7K citations

Natural Sciences, Mathematics, Algebra +8

The complexity of computing the permanent

Leslie G. Valiant · Theoretical Computer Science · 1979 · 2.8K citations

Computing, Computer Science, Mathematics +9

Algebraic methods in the theory of lower bounds for Boolean circuit complexity

Roman Smolensky · 1987 · 760 citations · Full text

Computing, Computer Science, Mathematics +16

Computational Complexity of Probabilistic Turing Machines

John Gill · SIAM Journal on Computing · 1977 · 694 citations

Computing, Computer Science, Mathematics +17