Very fast parallel matrix and polynomial arithmetic:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | Undetermined |
Veröffentlicht: |
Toronto
Univ. of Toronto, Dep. of Computer Science
1985
|
Schriftenreihe: | University <Toronto> / Department of Computer Science: Technical report
178 |
Schlagworte: | |
Beschreibung: | Zugl.: Toronto, Univ., Diss., 1985 |
Beschreibung: | 169 S. graph. Darst. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV005455574 | ||
003 | DE-604 | ||
005 | 19920806 | ||
007 | t | ||
008 | 920730s1985 d||| m||| 00||| undod | ||
035 | |a (OCoLC)630321115 | ||
035 | |a (DE-599)BVBBV005455574 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | |a und | ||
049 | |a DE-91 | ||
084 | |a MAT 653d |2 stub | ||
084 | |a MAT 657d |2 stub | ||
084 | |a DAT 532d |2 stub | ||
100 | 1 | |a Eberly, Wayne |e Verfasser |4 aut | |
245 | 1 | 0 | |a Very fast parallel matrix and polynomial arithmetic |c by Wayne Eberly |
264 | 1 | |a Toronto |b Univ. of Toronto, Dep. of Computer Science |c 1985 | |
300 | |a 169 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a University <Toronto> / Department of Computer Science: Technical report |v 178 | |
500 | |a Zugl.: Toronto, Univ., Diss., 1985 | ||
650 | 0 | 7 | |a Matrix |g Mathematik |0 (DE-588)4037968-1 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Polynom |0 (DE-588)4046711-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Effizienter Algorithmus |0 (DE-588)4125422-3 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
689 | 0 | 0 | |a Matrix |g Mathematik |0 (DE-588)4037968-1 |D s |
689 | 0 | 1 | |a Effizienter Algorithmus |0 (DE-588)4125422-3 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Polynom |0 (DE-588)4046711-9 |D s |
689 | 1 | 1 | |a Effizienter Algorithmus |0 (DE-588)4125422-3 |D s |
689 | 1 | |5 DE-604 | |
810 | 2 | |a Department of Computer Science: Technical report |t University <Toronto> |v 178 |w (DE-604)BV005455013 |9 178 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-003413434 |
Datensatz im Suchindex
_version_ | 1804119666681970688 |
---|---|
any_adam_object | |
author | Eberly, Wayne |
author_facet | Eberly, Wayne |
author_role | aut |
author_sort | Eberly, Wayne |
author_variant | w e we |
building | Verbundindex |
bvnumber | BV005455574 |
classification_tum | MAT 653d MAT 657d DAT 532d |
ctrlnum | (OCoLC)630321115 (DE-599)BVBBV005455574 |
discipline | Informatik Mathematik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01596nam a2200433 cb4500</leader><controlfield tag="001">BV005455574</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19920806 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">920730s1985 d||| m||| 00||| undod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)630321115</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV005455574</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 653d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 657d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 532d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Eberly, Wayne</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Very fast parallel matrix and polynomial arithmetic</subfield><subfield code="c">by Wayne Eberly</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Toronto</subfield><subfield code="b">Univ. of Toronto, Dep. of Computer Science</subfield><subfield code="c">1985</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">169 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">University <Toronto> / Department of Computer Science: Technical report</subfield><subfield code="v">178</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Toronto, Univ., Diss., 1985</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Matrix</subfield><subfield code="g">Mathematik</subfield><subfield code="0">(DE-588)4037968-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Polynom</subfield><subfield code="0">(DE-588)4046711-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Effizienter Algorithmus</subfield><subfield code="0">(DE-588)4125422-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Matrix</subfield><subfield code="g">Mathematik</subfield><subfield code="0">(DE-588)4037968-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Effizienter Algorithmus</subfield><subfield code="0">(DE-588)4125422-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Polynom</subfield><subfield code="0">(DE-588)4046711-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Effizienter Algorithmus</subfield><subfield code="0">(DE-588)4125422-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t">University <Toronto></subfield><subfield code="v">178</subfield><subfield code="w">(DE-604)BV005455013</subfield><subfield code="9">178</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-003413434</subfield></datafield></record></collection> |
genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
genre_facet | Hochschulschrift |
id | DE-604.BV005455574 |
illustrated | Illustrated |
indexdate | 2024-07-09T16:29:49Z |
institution | BVB |
language | Undetermined |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-003413434 |
oclc_num | 630321115 |
open_access_boolean | |
owner | DE-91 DE-BY-TUM |
owner_facet | DE-91 DE-BY-TUM |
physical | 169 S. graph. Darst. |
publishDate | 1985 |
publishDateSearch | 1985 |
publishDateSort | 1985 |
publisher | Univ. of Toronto, Dep. of Computer Science |
record_format | marc |
series2 | University <Toronto> / Department of Computer Science: Technical report |
spelling | Eberly, Wayne Verfasser aut Very fast parallel matrix and polynomial arithmetic by Wayne Eberly Toronto Univ. of Toronto, Dep. of Computer Science 1985 169 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier University <Toronto> / Department of Computer Science: Technical report 178 Zugl.: Toronto, Univ., Diss., 1985 Matrix Mathematik (DE-588)4037968-1 gnd rswk-swf Polynom (DE-588)4046711-9 gnd rswk-swf Effizienter Algorithmus (DE-588)4125422-3 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Matrix Mathematik (DE-588)4037968-1 s Effizienter Algorithmus (DE-588)4125422-3 s DE-604 Polynom (DE-588)4046711-9 s Department of Computer Science: Technical report University <Toronto> 178 (DE-604)BV005455013 178 |
spellingShingle | Eberly, Wayne Very fast parallel matrix and polynomial arithmetic Matrix Mathematik (DE-588)4037968-1 gnd Polynom (DE-588)4046711-9 gnd Effizienter Algorithmus (DE-588)4125422-3 gnd |
subject_GND | (DE-588)4037968-1 (DE-588)4046711-9 (DE-588)4125422-3 (DE-588)4113937-9 |
title | Very fast parallel matrix and polynomial arithmetic |
title_auth | Very fast parallel matrix and polynomial arithmetic |
title_exact_search | Very fast parallel matrix and polynomial arithmetic |
title_full | Very fast parallel matrix and polynomial arithmetic by Wayne Eberly |
title_fullStr | Very fast parallel matrix and polynomial arithmetic by Wayne Eberly |
title_full_unstemmed | Very fast parallel matrix and polynomial arithmetic by Wayne Eberly |
title_short | Very fast parallel matrix and polynomial arithmetic |
title_sort | very fast parallel matrix and polynomial arithmetic |
topic | Matrix Mathematik (DE-588)4037968-1 gnd Polynom (DE-588)4046711-9 gnd Effizienter Algorithmus (DE-588)4125422-3 gnd |
topic_facet | Matrix Mathematik Polynom Effizienter Algorithmus Hochschulschrift |
volume_link | (DE-604)BV005455013 |
work_keys_str_mv | AT eberlywayne veryfastparallelmatrixandpolynomialarithmetic |