In this note we consider, for a number of linear algebra problems, an environment allowing 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
LEONCINI, MAURO;
1991-01-01
Abstract
In this note we consider, for a number of linear algebra problems, an environment allowing 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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
