LEADER 01804nam  2200541   450 
001 996466160703316
005 20220817230222.0
010   $a3-540-39058-8
024 7 $a10.1007/3-540-13866-8
035   $a(CKB)1000000000230384
035   $a(SSID)ssj0000323843
035   $a(PQKBManifestationID)11237081
035   $a(PQKBTitleCode)TC0000323843
035   $a(PQKBWorkID)10303941
035   $a(PQKB)10926404
035   $a(DE-He213)978-3-540-39058-9
035   $a(MiAaPQ)EBC6806114
035   $a(Au-PeEL)EBL6806114
035   $a(OCoLC)793075115
035   $a(PPN)155217569
035   $a(EXLCZ)991000000000230384
100   $a20220817d1984      uy             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aHow to multiply matrices faster /$fV. Pan
205   $a1st ed. 1984.
210  1$aBerlin, Germany :$cSpringer,$d[1984]
210  4$dİ1984
215   $a1 online resource (XIV, 214 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v179
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-13866-8 
327   $aThe exponent of matrix multiplication -- Correlation between matrix multipilcation and other computational problems. Bit-time, bit-space, stability, and condition -- The speed-up of the multiplication of matrices of a fixed size.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v179
606   $aMatrices$xData processing
615  0$aMatrices$xData processing.
676   $a512.9434
700   $aPan$b Victor$01253538
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a996466160703316
996   $aHow to multiply matrices faster$92906375
997   $aUNISA