Bini D. Relations between EC-algorithms applications. Internal note IEI-B79-08, 1979. |

Abstract (English) |
The relation between APA-algorithms (i.e. approximating the result with an arbitrarily small error) and EC-algorithms (i.e. computing exactly the result) is analyzed. The existence of an APA-algorithm of complexity tB and degree d implies the existence of an EC-algorithm of complexity (l+d)tB. An applibation is given for problems associated to tensorial powers of a three-way array, such as matrix product, which brings to an improvement of Pan's result. | |

Subject |

1) Download Document PDF |

Open access Restricted Private