Parallel algorithms for arithmetics, irreducibility and factoring of GFq-polynomials:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Stanford, Calif.
1983
|
| Schriftenreihe: | Stanford University / Computer Science Department: Report STAN-CS
991 |
| Beschreibung: | 10 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009075837 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940227s1983 |||| 00||| eng d | ||
| 035 | |a (OCoLC)257913198 | ||
| 035 | |a (DE-599)BVBBV009075837 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Morgensteren, Moshe |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Parallel algorithms for arithmetics, irreducibility and factoring of GFq-polynomials |c Moshe Morgensteren ; Eli Shamir* |
| 264 | 1 | |a Stanford, Calif. |c 1983 | |
| 300 | |a 10 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Stanford University / Computer Science Department: Report STAN-CS |v 991 | |
| 700 | 1 | |a Shamir, Eli |e Verfasser |4 aut | |
| 810 | 2 | |a Computer Science Department: Report STAN-CS |t Stanford University |v 991 |w (DE-604)BV008928280 |9 991 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006013166 | ||
Datensatz im Suchindex
| _version_ | 1804123489725054976 |
|---|---|
| any_adam_object | |
| author | Morgensteren, Moshe Shamir, Eli |
| author_facet | Morgensteren, Moshe Shamir, Eli |
| author_role | aut aut |
| author_sort | Morgensteren, Moshe |
| author_variant | m m mm e s es |
| building | Verbundindex |
| bvnumber | BV009075837 |
| ctrlnum | (OCoLC)257913198 (DE-599)BVBBV009075837 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00951nam a2200277 cb4500</leader><controlfield tag="001">BV009075837</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940227s1983 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)257913198</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009075837</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="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Morgensteren, Moshe</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Parallel algorithms for arithmetics, irreducibility and factoring of GFq-polynomials</subfield><subfield code="c">Moshe Morgensteren ; Eli Shamir*</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1983</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">10 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">Stanford University / Computer Science Department: Report STAN-CS</subfield><subfield code="v">991</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shamir, Eli</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: Report STAN-CS</subfield><subfield code="t">Stanford University</subfield><subfield code="v">991</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">991</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006013166</subfield></datafield></record></collection> |
| id | DE-604.BV009075837 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:30:35Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006013166 |
| oclc_num | 257913198 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 10 S. |
| publishDate | 1983 |
| publishDateSearch | 1983 |
| publishDateSort | 1983 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN-CS |
| spelling | Morgensteren, Moshe Verfasser aut Parallel algorithms for arithmetics, irreducibility and factoring of GFq-polynomials Moshe Morgensteren ; Eli Shamir* Stanford, Calif. 1983 10 S. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN-CS 991 Shamir, Eli Verfasser aut Computer Science Department: Report STAN-CS Stanford University 991 (DE-604)BV008928280 991 |
| spellingShingle | Morgensteren, Moshe Shamir, Eli Parallel algorithms for arithmetics, irreducibility and factoring of GFq-polynomials |
| title | Parallel algorithms for arithmetics, irreducibility and factoring of GFq-polynomials |
| title_auth | Parallel algorithms for arithmetics, irreducibility and factoring of GFq-polynomials |
| title_exact_search | Parallel algorithms for arithmetics, irreducibility and factoring of GFq-polynomials |
| title_full | Parallel algorithms for arithmetics, irreducibility and factoring of GFq-polynomials Moshe Morgensteren ; Eli Shamir* |
| title_fullStr | Parallel algorithms for arithmetics, irreducibility and factoring of GFq-polynomials Moshe Morgensteren ; Eli Shamir* |
| title_full_unstemmed | Parallel algorithms for arithmetics, irreducibility and factoring of GFq-polynomials Moshe Morgensteren ; Eli Shamir* |
| title_short | Parallel algorithms for arithmetics, irreducibility and factoring of GFq-polynomials |
| title_sort | parallel algorithms for arithmetics irreducibility and factoring of gfq polynomials |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT morgensterenmoshe parallelalgorithmsforarithmeticsirreducibilityandfactoringofgfqpolynomials AT shamireli parallelalgorithmsforarithmeticsirreducibilityandfactoringofgfqpolynomials |