Monte-Carlo approximation algorithms for enumeration problems:
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Toronto
Univ. of Toronto, Dep. of Computer Science
1987
|
| Schriftenreihe: | University <Toronto> / Department of Computer Science: Technical report
203,[2] |
| Schlagworte: | |
| Beschreibung: | 18 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011841249 | ||
| 003 | DE-604 | ||
| 005 | 19980319 | ||
| 007 | t | ||
| 008 | 980319s1987 |||| 00||| eng d | ||
| 035 | |a (OCoLC)21933097 | ||
| 035 | |a (DE-599)BVBBV011841249 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91 | ||
| 082 | 0 | |a 510 |2 20 | |
| 100 | 1 | |a Karp, Richard |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Monte-Carlo approximation algorithms for enumeration problems |c Richard Karp ; Michael Luby ; Neal Madras |
| 264 | 1 | |a Toronto |b Univ. of Toronto, Dep. of Computer Science |c 1987 | |
| 300 | |a 18 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 203,[2] | |
| 650 | 4 | |a Combinatorial enumeration problems | |
| 650 | 4 | |a Monte Carlo method | |
| 700 | 1 | |a Luby, Michael |e Verfasser |4 aut | |
| 700 | 1 | |a Madras, Neal Noah |d 1957- |e Verfasser |0 (DE-588)124221831 |4 aut | |
| 810 | 2 | |a Department of Computer Science: Technical report |t University <Toronto> |v 203,[2] |w (DE-604)BV005455013 |9 203,2 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007996999 | ||
Datensatz im Suchindex
| _version_ | 1804126384437592064 |
|---|---|
| any_adam_object | |
| author | Karp, Richard Luby, Michael Madras, Neal Noah 1957- |
| author_GND | (DE-588)124221831 |
| author_facet | Karp, Richard Luby, Michael Madras, Neal Noah 1957- |
| author_role | aut aut aut |
| author_sort | Karp, Richard |
| author_variant | r k rk m l ml n n m nn nnm |
| building | Verbundindex |
| bvnumber | BV011841249 |
| ctrlnum | (OCoLC)21933097 (DE-599)BVBBV011841249 |
| dewey-full | 510 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 510 - Mathematics |
| dewey-raw | 510 |
| dewey-search | 510 |
| dewey-sort | 3510 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01174nam a2200325 cb4500</leader><controlfield tag="001">BV011841249</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19980319 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">980319s1987 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)21933097</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011841249</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-91</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">510</subfield><subfield code="2">20</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Karp, Richard</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Monte-Carlo approximation algorithms for enumeration problems</subfield><subfield code="c">Richard Karp ; Michael Luby ; Neal Madras</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">1987</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">18 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">203,[2]</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial enumeration problems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Monte Carlo method</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Luby, Michael</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Madras, Neal Noah</subfield><subfield code="d">1957-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)124221831</subfield><subfield code="4">aut</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">203,[2]</subfield><subfield code="w">(DE-604)BV005455013</subfield><subfield code="9">203,2</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007996999</subfield></datafield></record></collection> |
| id | DE-604.BV011841249 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:16:36Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007996999 |
| oclc_num | 21933097 |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 18 S. |
| publishDate | 1987 |
| publishDateSearch | 1987 |
| publishDateSort | 1987 |
| publisher | Univ. of Toronto, Dep. of Computer Science |
| record_format | marc |
| series2 | University <Toronto> / Department of Computer Science: Technical report |
| spelling | Karp, Richard Verfasser aut Monte-Carlo approximation algorithms for enumeration problems Richard Karp ; Michael Luby ; Neal Madras Toronto Univ. of Toronto, Dep. of Computer Science 1987 18 S. txt rdacontent n rdamedia nc rdacarrier University <Toronto> / Department of Computer Science: Technical report 203,[2] Combinatorial enumeration problems Monte Carlo method Luby, Michael Verfasser aut Madras, Neal Noah 1957- Verfasser (DE-588)124221831 aut Department of Computer Science: Technical report University <Toronto> 203,[2] (DE-604)BV005455013 203,2 |
| spellingShingle | Karp, Richard Luby, Michael Madras, Neal Noah 1957- Monte-Carlo approximation algorithms for enumeration problems Combinatorial enumeration problems Monte Carlo method |
| title | Monte-Carlo approximation algorithms for enumeration problems |
| title_auth | Monte-Carlo approximation algorithms for enumeration problems |
| title_exact_search | Monte-Carlo approximation algorithms for enumeration problems |
| title_full | Monte-Carlo approximation algorithms for enumeration problems Richard Karp ; Michael Luby ; Neal Madras |
| title_fullStr | Monte-Carlo approximation algorithms for enumeration problems Richard Karp ; Michael Luby ; Neal Madras |
| title_full_unstemmed | Monte-Carlo approximation algorithms for enumeration problems Richard Karp ; Michael Luby ; Neal Madras |
| title_short | Monte-Carlo approximation algorithms for enumeration problems |
| title_sort | monte carlo approximation algorithms for enumeration problems |
| topic | Combinatorial enumeration problems Monte Carlo method |
| topic_facet | Combinatorial enumeration problems Monte Carlo method |
| volume_link | (DE-604)BV005455013 |
| work_keys_str_mv | AT karprichard montecarloapproximationalgorithmsforenumerationproblems AT lubymichael montecarloapproximationalgorithmsforenumerationproblems AT madrasnealnoah montecarloapproximationalgorithmsforenumerationproblems |