In this note we consider, for a number of linear algebra problems, an environmentallowing approximate computations. Within this framework we show that the relative complexity of these problems should be studied according to a strict notion of reducibility, which corresponds to the well-known many-one reducibility of combinatorial complexity.
Parallel Algebraic Reductions among Numerical Problems / B., Codenotti; Leoncini, Mauro; G., Resta. - In: APPLIED MATHEMATICS LETTERS. - ISSN 0893-9659. - STAMPA. - 6:(1991), pp. 27-31.