Probabilistic algorithms in finite fields
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge, Mass.
Massachusetts Inst. of Technology, Lab. for Computer Science
1979
|
| Schlagworte: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021875963 | ||
| 003 | DE-604 | ||
| 005 | 20040229000000.0 | ||
| 007 | t | ||
| 008 | 880223s1979 |||| 00||| eng d | ||
| 035 | |a (OCoLC)5821623 | ||
| 035 | |a (DE-599)BVBBV021875963 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 050 | 0 | |a QA76.M41 | |
| 088 | |a MIT/LCS/TM-213 | ||
| 100 | 1 | |a Rabin, Michael O. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Probabilistic algorithms in finite fields |
| 264 | 1 | |a Cambridge, Mass. |b Massachusetts Inst. of Technology, Lab. for Computer Science |c 1979 | |
| 300 | |a 26 Bl. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a Algorithmes | |
| 650 | 4 | |a Champs modulaires | |
| 650 | 4 | |a Nombres, Théorie probabiliste des | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Finite fields (Algebra) | |
| 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 |
| 650 | 0 | 7 | |a Endliche Mathematik |0 (DE-588)4152155-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Zufallsauswahl |0 (DE-588)4191095-3 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Polynom |0 (DE-588)4046711-9 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Endliche Mathematik |0 (DE-588)4152155-9 |D s |
| 689 | 2 | |5 DE-604 | |
| 689 | 3 | 0 | |a Zufallsauswahl |0 (DE-588)4191095-3 |D s |
| 689 | 3 | |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015091605 | ||
Datensatz im Suchindex
| _version_ | 1804135815372079104 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Rabin, Michael O. |
| author_facet | Rabin, Michael O. |
| author_role | aut |
| author_sort | Rabin, Michael O. |
| author_variant | m o r mo mor |
| building | Verbundindex |
| bvnumber | BV021875963 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.M41 |
| callnumber-search | QA76.M41 |
| callnumber-sort | QA 276 M41 |
| callnumber-subject | QA - Mathematics |
| ctrlnum | (OCoLC)5821623 (DE-599)BVBBV021875963 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01472nam a2200469zc 4500</leader><controlfield tag="001">BV021875963</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040229000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">880223s1979 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)5821623</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021875963</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.M41</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">MIT/LCS/TM-213</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Rabin, Michael O.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Probabilistic algorithms in finite fields</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">Massachusetts Inst. of Technology, Lab. for Computer Science</subfield><subfield code="c">1979</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">26 Bl.</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="650" ind1=" " ind2="4"><subfield code="a">Algorithmes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Champs modulaires</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Nombres, Théorie probabiliste des</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Finite fields (Algebra)</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="650" ind1="0" ind2="7"><subfield code="a">Endliche Mathematik</subfield><subfield code="0">(DE-588)4152155-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Zufallsauswahl</subfield><subfield code="0">(DE-588)4191095-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><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="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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Endliche Mathematik</subfield><subfield code="0">(DE-588)4152155-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Zufallsauswahl</subfield><subfield code="0">(DE-588)4191095-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015091605</subfield></datafield></record></collection> |
| id | DE-604.BV021875963 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T16:03:35Z |
| indexdate | 2024-07-09T20:46:30Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015091605 |
| oclc_num | 5821623 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 26 Bl. |
| publishDate | 1979 |
| publishDateSearch | 1979 |
| publishDateSort | 1979 |
| publisher | Massachusetts Inst. of Technology, Lab. for Computer Science |
| record_format | marc |
| spelling | Rabin, Michael O. Verfasser aut Probabilistic algorithms in finite fields Cambridge, Mass. Massachusetts Inst. of Technology, Lab. for Computer Science 1979 26 Bl. txt rdacontent n rdamedia nc rdacarrier Algorithmes Champs modulaires Nombres, Théorie probabiliste des Algorithms Finite fields (Algebra) Algorithmus (DE-588)4001183-5 gnd rswk-swf Polynom (DE-588)4046711-9 gnd rswk-swf Endliche Mathematik (DE-588)4152155-9 gnd rswk-swf Zufallsauswahl (DE-588)4191095-3 gnd rswk-swf Algorithmus (DE-588)4001183-5 s DE-604 Polynom (DE-588)4046711-9 s Endliche Mathematik (DE-588)4152155-9 s Zufallsauswahl (DE-588)4191095-3 s |
| spellingShingle | Rabin, Michael O. Probabilistic algorithms in finite fields Algorithmes Champs modulaires Nombres, Théorie probabiliste des Algorithms Finite fields (Algebra) Algorithmus (DE-588)4001183-5 gnd Polynom (DE-588)4046711-9 gnd Endliche Mathematik (DE-588)4152155-9 gnd Zufallsauswahl (DE-588)4191095-3 gnd |
| subject_GND | (DE-588)4001183-5 (DE-588)4046711-9 (DE-588)4152155-9 (DE-588)4191095-3 |
| title | Probabilistic algorithms in finite fields |
| title_auth | Probabilistic algorithms in finite fields |
| title_exact_search | Probabilistic algorithms in finite fields |
| title_exact_search_txtP | Probabilistic algorithms in finite fields |
| title_full | Probabilistic algorithms in finite fields |
| title_fullStr | Probabilistic algorithms in finite fields |
| title_full_unstemmed | Probabilistic algorithms in finite fields |
| title_short | Probabilistic algorithms in finite fields |
| title_sort | probabilistic algorithms in finite fields |
| topic | Algorithmes Champs modulaires Nombres, Théorie probabiliste des Algorithms Finite fields (Algebra) Algorithmus (DE-588)4001183-5 gnd Polynom (DE-588)4046711-9 gnd Endliche Mathematik (DE-588)4152155-9 gnd Zufallsauswahl (DE-588)4191095-3 gnd |
| topic_facet | Algorithmes Champs modulaires Nombres, Théorie probabiliste des Algorithms Finite fields (Algebra) Algorithmus Polynom Endliche Mathematik Zufallsauswahl |
| work_keys_str_mv | AT rabinmichaelo probabilisticalgorithmsinfinitefields |