Using hard problems to create pseudorandom generators:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge, Mass. u.a.
MIT Pr.
1992
|
| Schriftenreihe: | Association for Computing Machinery: ACM distinguished dissertations
1990 |
| Schlagworte: | |
| Beschreibung: | Zugl.: Berkeley, Calif., Univ., Diss., 1988 |
| Beschreibung: | VI, 43 S. |
| ISBN: | 0262140519 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV005460404 | ||
| 003 | DE-604 | ||
| 005 | 19970527 | ||
| 007 | t | ||
| 008 | 920806s1992 m||| 00||| eng d | ||
| 020 | |a 0262140519 |9 0-262-14051-9 | ||
| 035 | |a (OCoLC)24848488 | ||
| 035 | |a (DE-599)BVBBV005460404 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-384 |a DE-12 |a DE-706 |a DE-91G | ||
| 050 | 0 | |a QA298 | |
| 082 | 0 | |a 519.4 |2 20 | |
| 084 | |a ST 600 |0 (DE-625)143681: |2 rvk | ||
| 084 | |a DAT 349d |2 stub | ||
| 084 | |a DAT 538d |2 stub | ||
| 084 | |a DAT 517d |2 stub | ||
| 100 | 1 | |a Nisan, Noam |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Using hard problems to create pseudorandom generators |c Noam Nisan |
| 264 | 1 | |a Cambridge, Mass. u.a. |b MIT Pr. |c 1992 | |
| 300 | |a VI, 43 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Association for Computing Machinery: ACM distinguished dissertations |v 1990 | |
| 500 | |a Zugl.: Berkeley, Calif., Univ., Diss., 1988 | ||
| 650 | 7 | |a Analise combinatoria |2 larpcal | |
| 650 | 4 | |a Complexité de calcul (Informatique) | |
| 650 | 7 | |a Computabilidade e modelos de computacao |2 larpcal | |
| 650 | 7 | |a Fundamentele informatica |2 gtt | |
| 650 | 4 | |a Générateurs de nombres aléatoires | |
| 650 | 7 | |a Générateurs de nombres aléatoires |2 ram | |
| 650 | 7 | |a complexité calcul |2 inriac | |
| 650 | 7 | |a génération nombre aléatoire |2 inriac | |
| 650 | 7 | |a nombre pseudo-aléatoire |2 inriac | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Random number generators | |
| 650 | 0 | 7 | |a Zufallsgenerator |0 (DE-588)4191097-7 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Zufallsgenerator |0 (DE-588)4191097-7 |D s |
| 689 | 0 | |5 DE-604 | |
| 830 | 0 | |a Association for Computing Machinery: ACM distinguished dissertations |v 1990 |w (DE-604)BV001894450 |9 1990 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-003417316 | ||
Datensatz im Suchindex
| _version_ | 1804119672907366400 |
|---|---|
| any_adam_object | |
| author | Nisan, Noam |
| author_facet | Nisan, Noam |
| author_role | aut |
| author_sort | Nisan, Noam |
| author_variant | n n nn |
| building | Verbundindex |
| bvnumber | BV005460404 |
| callnumber-first | Q - Science |
| callnumber-label | QA298 |
| callnumber-raw | QA298 |
| callnumber-search | QA298 |
| callnumber-sort | QA 3298 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 600 |
| classification_tum | DAT 349d DAT 538d DAT 517d |
| ctrlnum | (OCoLC)24848488 (DE-599)BVBBV005460404 |
| dewey-full | 519.4 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 519 - Probabilities and applied mathematics |
| dewey-raw | 519.4 |
| dewey-search | 519.4 |
| dewey-sort | 3519.4 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01944nam a2200541 cb4500</leader><controlfield tag="001">BV005460404</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19970527 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">920806s1992 m||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0262140519</subfield><subfield code="9">0-262-14051-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24848488</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV005460404</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-384</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA298</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.4</subfield><subfield code="2">20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 600</subfield><subfield code="0">(DE-625)143681:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 349d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 538d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 517d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Nisan, Noam</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Using hard problems to create pseudorandom generators</subfield><subfield code="c">Noam Nisan</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass. u.a.</subfield><subfield code="b">MIT Pr.</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VI, 43 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">Association for Computing Machinery: ACM distinguished dissertations</subfield><subfield code="v">1990</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Berkeley, Calif., Univ., Diss., 1988</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Analise combinatoria</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexité de calcul (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computabilidade e modelos de computacao</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Fundamentele informatica</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Générateurs de nombres aléatoires</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Générateurs de nombres aléatoires</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">complexité calcul</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">génération nombre aléatoire</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">nombre pseudo-aléatoire</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Random number generators</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Zufallsgenerator</subfield><subfield code="0">(DE-588)4191097-7</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">Zufallsgenerator</subfield><subfield code="0">(DE-588)4191097-7</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">Association for Computing Machinery: ACM distinguished dissertations</subfield><subfield code="v">1990</subfield><subfield code="w">(DE-604)BV001894450</subfield><subfield code="9">1990</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-003417316</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV005460404 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T16:29:55Z |
| institution | BVB |
| isbn | 0262140519 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-003417316 |
| oclc_num | 24848488 |
| open_access_boolean | |
| owner | DE-384 DE-12 DE-706 DE-91G DE-BY-TUM |
| owner_facet | DE-384 DE-12 DE-706 DE-91G DE-BY-TUM |
| physical | VI, 43 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| publisher | MIT Pr. |
| record_format | marc |
| series | Association for Computing Machinery: ACM distinguished dissertations |
| series2 | Association for Computing Machinery: ACM distinguished dissertations |
| spelling | Nisan, Noam Verfasser aut Using hard problems to create pseudorandom generators Noam Nisan Cambridge, Mass. u.a. MIT Pr. 1992 VI, 43 S. txt rdacontent n rdamedia nc rdacarrier Association for Computing Machinery: ACM distinguished dissertations 1990 Zugl.: Berkeley, Calif., Univ., Diss., 1988 Analise combinatoria larpcal Complexité de calcul (Informatique) Computabilidade e modelos de computacao larpcal Fundamentele informatica gtt Générateurs de nombres aléatoires Générateurs de nombres aléatoires ram complexité calcul inriac génération nombre aléatoire inriac nombre pseudo-aléatoire inriac Computational complexity Random number generators Zufallsgenerator (DE-588)4191097-7 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Zufallsgenerator (DE-588)4191097-7 s DE-604 Association for Computing Machinery: ACM distinguished dissertations 1990 (DE-604)BV001894450 1990 |
| spellingShingle | Nisan, Noam Using hard problems to create pseudorandom generators Association for Computing Machinery: ACM distinguished dissertations Analise combinatoria larpcal Complexité de calcul (Informatique) Computabilidade e modelos de computacao larpcal Fundamentele informatica gtt Générateurs de nombres aléatoires Générateurs de nombres aléatoires ram complexité calcul inriac génération nombre aléatoire inriac nombre pseudo-aléatoire inriac Computational complexity Random number generators Zufallsgenerator (DE-588)4191097-7 gnd |
| subject_GND | (DE-588)4191097-7 (DE-588)4113937-9 |
| title | Using hard problems to create pseudorandom generators |
| title_auth | Using hard problems to create pseudorandom generators |
| title_exact_search | Using hard problems to create pseudorandom generators |
| title_full | Using hard problems to create pseudorandom generators Noam Nisan |
| title_fullStr | Using hard problems to create pseudorandom generators Noam Nisan |
| title_full_unstemmed | Using hard problems to create pseudorandom generators Noam Nisan |
| title_short | Using hard problems to create pseudorandom generators |
| title_sort | using hard problems to create pseudorandom generators |
| topic | Analise combinatoria larpcal Complexité de calcul (Informatique) Computabilidade e modelos de computacao larpcal Fundamentele informatica gtt Générateurs de nombres aléatoires Générateurs de nombres aléatoires ram complexité calcul inriac génération nombre aléatoire inriac nombre pseudo-aléatoire inriac Computational complexity Random number generators Zufallsgenerator (DE-588)4191097-7 gnd |
| topic_facet | Analise combinatoria Complexité de calcul (Informatique) Computabilidade e modelos de computacao Fundamentele informatica Générateurs de nombres aléatoires complexité calcul génération nombre aléatoire nombre pseudo-aléatoire Computational complexity Random number generators Zufallsgenerator Hochschulschrift |
| volume_link | (DE-604)BV001894450 |
| work_keys_str_mv | AT nisannoam usinghardproblemstocreatepseudorandomgenerators |