Journal of Complexity · 1992 · 26 citations · 13 references
ComputingComputer ScienceAlgebraAlgorithmsTheory Of ComputationAlgorithm AnalysisAlgorithmic ComplexityComplexity TheoryComputational ComplexityComputational Complexity ClassesTime ComplexityComplexityGeneric PolynomialsPolynomial SpacePolynomial Time ComplexityPolynomial-time Algorithms
13
Lower bounds for algebraic computation trees
Michael Ben-Or · 1983 · 527 citations · Full text
The complexity of partial derivatives
Walter Bäur, Volker Strassen · Theoretical Computer Science · 1983 · 482 citations
Lower bounds for algebraic decision trees
John Steele, Andrew Chi-Chih Yao · Journal of Algorithms · 1982 · 152 citations
The Computational Complexity of Continued Fractions
Volker Strassen · SIAM Journal on Computing · 1983 · 97 citations