O (n?2.7799) complexity for nXn approximate matrix multiplication

Academic Article
Publication Date:
1979
abstract:
No abstract available
Iris type:
01.01 Articolo in rivista
Keywords:
analysis of algorithms; computational complexity; numerical mathematics
List of contributors:
Handle:
https://iris.cnr.it/handle/20.500.14243/379337
Published in:
INFORMATION PROCESSING LETTERS
Journal