Primality testing in polynomial time: from randomized algorithms to "Primes is in p"
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | German |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2004
|
| Schriftenreihe: | Lecture notes in computer science
3000 : tutorial |
| Schlagworte: | |
| Online-Zugang: | TUM01 UBA01 UBG01 UBM01 UBY01 UPA01 Volltext |
| Beschreibung: | 1 Online-Ressource (X, 147 S.) |
| ISBN: | 3540403442 |
| DOI: | 10.1007/b12334 |
Internformat
MARC
| LEADER | 00000nmm a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV023480189 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 080806s2004 gw |||| o||u| ||||||ger d | ||
| 020 | |a 3540403442 |9 3-540-40344-2 | ||
| 024 | 7 | |a 10.1007/b12334 |2 doi | |
| 035 | |a (OCoLC)249081149 | ||
| 035 | |a (DE-599)BVBBV023480189 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a ger | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-19 |a DE-473 |a DE-91 |a DE-706 |a DE-739 |a DE-384 | ||
| 082 | 0 | |a 512.942 | |
| 084 | |a SS 4800 |0 (DE-625)143528: |2 rvk | ||
| 084 | |a DAT 000 |2 stub | ||
| 084 | |a DAT 532f |2 stub | ||
| 100 | 1 | |a Dietzfelbinger, Martin |d 1956- |e Verfasser |0 (DE-588)130020761 |4 aut | |
| 245 | 1 | 0 | |a Primality testing in polynomial time |b from randomized algorithms to "Primes is in p" |c Martin Dietzfelbinger |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2004 | |
| 300 | |a 1 Online-Ressource (X, 147 S.) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 3000 : tutorial | |
| 650 | 0 | 7 | |a Effizienter Algorithmus |0 (DE-588)4125422-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Primzahltest |0 (DE-588)4704538-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Polynomialzeitalgorithmus |0 (DE-588)4199652-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Primzahltest |0 (DE-588)4704538-3 |D s |
| 689 | 0 | 1 | |a Polynomialzeitalgorithmus |0 (DE-588)4199652-5 |D s |
| 689 | 0 | 2 | |a Effizienter Algorithmus |0 (DE-588)4125422-3 |D s |
| 689 | 0 | |5 DE-604 | |
| 830 | 0 | |a Lecture notes in computer science |v 3000 : tutorial |w (DE-604)BV014880109 |9 3000 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/b12334 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-SCS | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-016662356 | ||
| 966 | e | |u https://doi.org/10.1007/b12334 |l TUM01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/b12334 |l UBA01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/b12334 |l UBG01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/b12334 |l UBM01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/b12334 |l UBY01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/b12334 |l UPA01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804137906085822464 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Dietzfelbinger, Martin 1956- |
| author_GND | (DE-588)130020761 |
| author_facet | Dietzfelbinger, Martin 1956- |
| author_role | aut |
| author_sort | Dietzfelbinger, Martin 1956- |
| author_variant | m d md |
| building | Verbundindex |
| bvnumber | BV023480189 |
| classification_rvk | SS 4800 |
| classification_tum | DAT 000 DAT 532f |
| collection | ZDB-2-SCS |
| ctrlnum | (OCoLC)249081149 (DE-599)BVBBV023480189 |
| dewey-full | 512.942 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 512 - Algebra |
| dewey-raw | 512.942 |
| dewey-search | 512.942 |
| dewey-sort | 3512.942 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| discipline_str_mv | Informatik Mathematik |
| doi_str_mv | 10.1007/b12334 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02204nmm a2200529 cb4500</leader><controlfield tag="001">BV023480189</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">080806s2004 gw |||| o||u| ||||||ger d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540403442</subfield><subfield code="9">3-540-40344-2</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/b12334</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)249081149</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV023480189</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">ger</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-19</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-384</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">512.942</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SS 4800</subfield><subfield code="0">(DE-625)143528:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 532f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Dietzfelbinger, Martin</subfield><subfield code="d">1956-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)130020761</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Primality testing in polynomial time</subfield><subfield code="b">from randomized algorithms to "Primes is in p"</subfield><subfield code="c">Martin Dietzfelbinger</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2004</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (X, 147 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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">3000 : tutorial</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="650" ind1="0" ind2="7"><subfield code="a">Primzahltest</subfield><subfield code="0">(DE-588)4704538-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Polynomialzeitalgorithmus</subfield><subfield code="0">(DE-588)4199652-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Primzahltest</subfield><subfield code="0">(DE-588)4704538-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Polynomialzeitalgorithmus</subfield><subfield code="0">(DE-588)4199652-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><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="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">3000 : tutorial</subfield><subfield code="w">(DE-604)BV014880109</subfield><subfield code="9">3000</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/b12334</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SCS</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-016662356</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/b12334</subfield><subfield code="l">TUM01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/b12334</subfield><subfield code="l">UBA01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/b12334</subfield><subfield code="l">UBG01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/b12334</subfield><subfield code="l">UBM01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/b12334</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/b12334</subfield><subfield code="l">UPA01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV023480189 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T21:37:40Z |
| indexdate | 2024-07-09T21:19:44Z |
| institution | BVB |
| isbn | 3540403442 |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016662356 |
| oclc_num | 249081149 |
| open_access_boolean | |
| owner | DE-19 DE-BY-UBM DE-473 DE-BY-UBG DE-91 DE-BY-TUM DE-706 DE-739 DE-384 |
| owner_facet | DE-19 DE-BY-UBM DE-473 DE-BY-UBG DE-91 DE-BY-TUM DE-706 DE-739 DE-384 |
| physical | 1 Online-Ressource (X, 147 S.) |
| psigel | ZDB-2-SCS |
| publishDate | 2004 |
| publishDateSearch | 2004 |
| publishDateSort | 2004 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | Dietzfelbinger, Martin 1956- Verfasser (DE-588)130020761 aut Primality testing in polynomial time from randomized algorithms to "Primes is in p" Martin Dietzfelbinger Berlin [u.a.] Springer 2004 1 Online-Ressource (X, 147 S.) txt rdacontent c rdamedia cr rdacarrier Lecture notes in computer science 3000 : tutorial Effizienter Algorithmus (DE-588)4125422-3 gnd rswk-swf Primzahltest (DE-588)4704538-3 gnd rswk-swf Polynomialzeitalgorithmus (DE-588)4199652-5 gnd rswk-swf Primzahltest (DE-588)4704538-3 s Polynomialzeitalgorithmus (DE-588)4199652-5 s Effizienter Algorithmus (DE-588)4125422-3 s DE-604 Lecture notes in computer science 3000 : tutorial (DE-604)BV014880109 3000 https://doi.org/10.1007/b12334 Verlag Volltext |
| spellingShingle | Dietzfelbinger, Martin 1956- Primality testing in polynomial time from randomized algorithms to "Primes is in p" Lecture notes in computer science Effizienter Algorithmus (DE-588)4125422-3 gnd Primzahltest (DE-588)4704538-3 gnd Polynomialzeitalgorithmus (DE-588)4199652-5 gnd |
| subject_GND | (DE-588)4125422-3 (DE-588)4704538-3 (DE-588)4199652-5 |
| title | Primality testing in polynomial time from randomized algorithms to "Primes is in p" |
| title_auth | Primality testing in polynomial time from randomized algorithms to "Primes is in p" |
| title_exact_search | Primality testing in polynomial time from randomized algorithms to "Primes is in p" |
| title_exact_search_txtP | Primality testing in polynomial time from randomized algorithms to "Primes is in p" |
| title_full | Primality testing in polynomial time from randomized algorithms to "Primes is in p" Martin Dietzfelbinger |
| title_fullStr | Primality testing in polynomial time from randomized algorithms to "Primes is in p" Martin Dietzfelbinger |
| title_full_unstemmed | Primality testing in polynomial time from randomized algorithms to "Primes is in p" Martin Dietzfelbinger |
| title_short | Primality testing in polynomial time |
| title_sort | primality testing in polynomial time from randomized algorithms to primes is in p |
| title_sub | from randomized algorithms to "Primes is in p" |
| topic | Effizienter Algorithmus (DE-588)4125422-3 gnd Primzahltest (DE-588)4704538-3 gnd Polynomialzeitalgorithmus (DE-588)4199652-5 gnd |
| topic_facet | Effizienter Algorithmus Primzahltest Polynomialzeitalgorithmus |
| url | https://doi.org/10.1007/b12334 |
| volume_link | (DE-604)BV014880109 |
| work_keys_str_mv | AT dietzfelbingermartin primalitytestinginpolynomialtimefromrandomizedalgorithmstoprimesisinp |