Concepedia
Foundations of Computational Mathematics · 2003 · 24 citations · 11 references
Mathematical ProgrammingDiscrete MathematicsMatrix TheoryMatrix AnalysisLow-rank ApproximationVandermonde Matrices
11
The complexity and approximability of finding maximum feasible subsystems of linear relations
E. Amaldi, Viggo Kann · Theoretical Computer Science · 1995 · 201 citations
Mathematical Programming, Maximum Feasible Subsystems, Constraint Solving +11
New algorithms for finding irreducible polynomials over finite fields
Victor Shoup · Mathematics of Computation · 1990 · 170 citations · Full text
Computational Complexity Theory, Engineering, Computational Number Theory +8
A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
Ketan Mulmuley · COMBINATORICA · 1987 · 166 citations
Numerical Analysis, Computational Science, Engineering +11
Point Location in Arrangements of Hyperplanes
Stefan Meiser · Information and Computation · 1993 · 155 citations
Mathematical Programming, Discrete Geometry, Engineering +5
A Polynomial Linear Search Algorithm for the <i>n</i> -Dimensional Knapsack Problem
Friedhelm Meyer auf der Heide · Journal of the ACM · 1984 · 83 citations
Mathematical Programming, Engineering, Analysis Of Algorithm +23