Complexity results on the functional decomposition of polynomials:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | Undetermined |
| Veröffentlicht: |
Toronto
Univ. of Toronto, Dep. of Computer Science
1988
|
| Schriftenreihe: | University <Toronto> / Department of Computer Science: Technical report
209 |
| Schlagworte: | |
| Beschreibung: | Zugl.: Toronto, Univ., Diss., 1988 |
| Beschreibung: | 131, 16 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV005455222 | ||
| 003 | DE-604 | ||
| 005 | 19920804 | ||
| 007 | t | ||
| 008 | 920730s1988 m||| 00||| undod | ||
| 035 | |a (OCoLC)630319838 | ||
| 035 | |a (DE-599)BVBBV005455222 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | |a und | ||
| 049 | |a DE-91 | ||
| 084 | |a MAT 169d |2 stub | ||
| 084 | |a DAT 535d |2 stub | ||
| 100 | 1 | |a Giesbrecht, Mark W. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Complexity results on the functional decomposition of polynomials |c Mark William Giesbrecht |
| 264 | 1 | |a Toronto |b Univ. of Toronto, Dep. of Computer Science |c 1988 | |
| 300 | |a 131, 16 S. | ||
| 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 209 | |
| 500 | |a Zugl.: Toronto, Univ., Diss., 1988 | ||
| 650 | 0 | 7 | |a Faktorisierung |0 (DE-588)4128927-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Polynom |0 (DE-588)4046711-9 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Polynom |0 (DE-588)4046711-9 |D s |
| 689 | 0 | 1 | |a Faktorisierung |0 (DE-588)4128927-4 |D s |
| 689 | 0 | 2 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 810 | 2 | |a Department of Computer Science: Technical report |t University <Toronto> |v 209 |w (DE-604)BV005455013 |9 209 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-003413146 | ||
Datensatz im Suchindex
| _version_ | 1804119666214305792 |
|---|---|
| any_adam_object | |
| author | Giesbrecht, Mark W. |
| author_facet | Giesbrecht, Mark W. |
| author_role | aut |
| author_sort | Giesbrecht, Mark W. |
| author_variant | m w g mw mwg |
| building | Verbundindex |
| bvnumber | BV005455222 |
| classification_tum | MAT 169d DAT 535d |
| ctrlnum | (OCoLC)630319838 (DE-599)BVBBV005455222 |
| discipline | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01465nam a2200397 cb4500</leader><controlfield tag="001">BV005455222</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19920804 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">920730s1988 m||| 00||| undod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)630319838</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV005455222</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 169d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 535d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Giesbrecht, Mark W.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Complexity results on the functional decomposition of polynomials</subfield><subfield code="c">Mark William Giesbrecht</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">1988</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">131, 16 S.</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">209</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Toronto, Univ., Diss., 1988</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Faktorisierung</subfield><subfield code="0">(DE-588)4128927-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</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="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">Polynom</subfield><subfield code="0">(DE-588)4046711-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Faktorisierung</subfield><subfield code="0">(DE-588)4128927-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" 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">209</subfield><subfield code="w">(DE-604)BV005455013</subfield><subfield code="9">209</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-003413146</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV005455222 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T16:29:49Z |
| institution | BVB |
| language | Undetermined |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-003413146 |
| oclc_num | 630319838 |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 131, 16 S. |
| publishDate | 1988 |
| publishDateSearch | 1988 |
| publishDateSort | 1988 |
| publisher | Univ. of Toronto, Dep. of Computer Science |
| record_format | marc |
| series2 | University <Toronto> / Department of Computer Science: Technical report |
| spelling | Giesbrecht, Mark W. Verfasser aut Complexity results on the functional decomposition of polynomials Mark William Giesbrecht Toronto Univ. of Toronto, Dep. of Computer Science 1988 131, 16 S. txt rdacontent n rdamedia nc rdacarrier University <Toronto> / Department of Computer Science: Technical report 209 Zugl.: Toronto, Univ., Diss., 1988 Faktorisierung (DE-588)4128927-4 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Polynom (DE-588)4046711-9 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Polynom (DE-588)4046711-9 s Faktorisierung (DE-588)4128927-4 s Algorithmus (DE-588)4001183-5 s DE-604 Department of Computer Science: Technical report University <Toronto> 209 (DE-604)BV005455013 209 |
| spellingShingle | Giesbrecht, Mark W. Complexity results on the functional decomposition of polynomials Faktorisierung (DE-588)4128927-4 gnd Algorithmus (DE-588)4001183-5 gnd Polynom (DE-588)4046711-9 gnd |
| subject_GND | (DE-588)4128927-4 (DE-588)4001183-5 (DE-588)4046711-9 (DE-588)4113937-9 |
| title | Complexity results on the functional decomposition of polynomials |
| title_auth | Complexity results on the functional decomposition of polynomials |
| title_exact_search | Complexity results on the functional decomposition of polynomials |
| title_full | Complexity results on the functional decomposition of polynomials Mark William Giesbrecht |
| title_fullStr | Complexity results on the functional decomposition of polynomials Mark William Giesbrecht |
| title_full_unstemmed | Complexity results on the functional decomposition of polynomials Mark William Giesbrecht |
| title_short | Complexity results on the functional decomposition of polynomials |
| title_sort | complexity results on the functional decomposition of polynomials |
| topic | Faktorisierung (DE-588)4128927-4 gnd Algorithmus (DE-588)4001183-5 gnd Polynom (DE-588)4046711-9 gnd |
| topic_facet | Faktorisierung Algorithmus Polynom Hochschulschrift |
| volume_link | (DE-604)BV005455013 |
| work_keys_str_mv | AT giesbrechtmarkw complexityresultsonthefunctionaldecompositionofpolynomials |