| Record ID | marc_columbia/Columbia-extract-20221130-002.mrc:71852200:1400 |
| Source | marc_columbia |
| Download Link | /show-records/marc_columbia/Columbia-extract-20221130-002.mrc:71852200:1400?format=raw |
LEADER: 01400cam a2200361 a 4500
001 558865
005 20220525200338.0
008 870429t19871987gw a b 001 0 eng d
020 $a038717205X (flexicover)
035 $a(OCoLC)15232837
035 $a(OCoLC)ocm15232837
035 $a(CStRLIN)NYCG87-B38984
035 $9ACL1916CU
035 $a(NNC)558865
035 $a558865
040 $aNNC$cNNC
090 $aQA243$b.D43 1987
100 1 $aDe Groote, H. F.$q(Hans F.)$0http://id.loc.gov/authorities/names/n85346924
245 10 $aLectures on the complexity of bilinear problems /$cH.F. de Groote.
260 $aBerlin ;$aNew York :$bSpringer-Verlag,$c[1987], ©1987.
300 $a135 pages :$billustrations ;$c24 cm.
336 $atext$2rdacontent
337 $aunmediated$2rdamedia
338 $avolume$2rdacarrier
490 1 $aLecture notes in computer science ;$v245
504 $aBibliography: p. [129]-133.
500 $aIncludes index.
650 0 $aBilinear forms.$0http://id.loc.gov/authorities/subjects/sh85050823
650 0 $aComputational complexity.$0http://id.loc.gov/authorities/subjects/sh85029473
650 0 $aAlgorithms.$0http://id.loc.gov/authorities/subjects/sh85003487
740 4 $aThe complexity of bilinear problems.
830 0 $aLecture notes in computer science ;$v245.$0http://id.loc.gov/authorities/names/n42015162
852 00 $boff,eng$hQA243$i.D43 1987