Theoretical Computer Science · 2012 · 114 citations · 19 references
ComputingComputer ScienceMathematicsAlgebraCircuit TheoryTheory Of ComputationCircuit ComplexityComputational ComplexityRandomized ComplexityArithmetic Circuit ComplexityArithmetic CircuitsBoolean Circuit ComplexityBounded-depth CircuitsCircuit Lower BoundsDerandomizationIdentity TestingPolynomial-size Circuits
19
Completeness classes in algebra
Leslie G. Valiant · 1979 · 487 citations · Full text
Fast Parallel Computation of Polynomials Using Few Processors
Leslie G. Valiant, Sven Skyum, S. J. Berkowitz et al. · SIAM Journal on Computing · 1983 · 283 citations
Lower bounds for non-commutative computation
Noam Nisan · 1991 · 203 citations
Properties that characterize LOGCFL
H. Venkateswaran · Journal of Computer and System Sciences · 1991 · 120 citations
An exponential lower bound for depth 3 arithmetic circuits
Dima Grigoriev, Marek Karpiński · 1998 · 93 citations · Full text