Journal of Symbolic Computation · 1992 · 622 citations · 23 references
ComputingComputer ScienceMathematicsComputational GeometrySet TheoryTheory Of ComputationAlgorithm AnalysisAlgorithmic ComplexityComplexity TheoryComputational AlgebraComputational ComplexityCompleteness ResultsComplexity AnalysisComplexity-theoretic HardnessLower BoundsQuantifier EliminationReal-number Modeling
23
A new polynomial-time algorithm for linear programming
Narendra Karmarkar · COMBINATORICA · 1984 · 4.8K citations
Some algebraic and geometric computations in PSPACE
John Canny · 1988 · 581 citations · Full text