Theoretical Computer Science · 1998 · 46 citations · 9 references
ComputingComputer EngineeringComputer ScienceAlgorithmsComputer ArchitectureTheory Of ComputationAlgorithmic ComplexityCircuit ComplexityComplexity TheoryComputational ComplexityComputational Complexity ClassesParameterized AlgorithmsCircuit Complexity HierarchiesCircuit Complexity Of Boolean FunctionsCircuit Lower BoundsParameterized ComplexityW-hierarchy
9
Matrix multiplication via arithmetic progressions
Don Coppersmith, S. Winograd · Journal of Symbolic Computation · 1990 · 2.3K citations
PP is as Hard as the Polynomial-Time Hierarchy
Seinosuke Toda · SIAM Journal on Computing · 1991 · 677 citations