Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=PASCAL83X0372480

ON THE ASYMPTOTIC COMPLEXITY OF RECTANGULAR MATRIX MULTIPLICATION

Author
LOTTI G; ROMANI F
UNIV. PISA, IST. SCI. INFORMAZIONE/PISA/ITA
Source
THEORETICAL COMPUTER SCIENCES; ISSN 0304-3975; NLD; DA. 1983; VOL. 23; NO 2; PP. 171-185; BIBL. 10 REF.
Document type
Article
Language
English
Keyword (fr)
CALCULABILITE COMPLEXITE CALCUL PRODUIT MATRICE INFORMATIQUE MATHEMATIQUES APPLIQUEES
Keyword (en)
CALCULABILITY COMPUTING COMPLEXITY MATRIX PRODUCT COMPUTER SCIENCES APPLIED MATHEMATICS
Keyword (es)
INFORMATICA MATEMATICAS APPLICADAS
Classification
Pascal
001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics

Discipline
Mathematics
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
PASCAL83X0372480

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Searching the Web