Randomness and completeness in computational complexity:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin ; Heidelberg ; New York ; Barcelona ; Hong Kong ; London
Springer
2000
|
| Schriftenreihe: | Lecture notes in computer science
Vol. 1950 |
| Schlagworte: | |
| Beschreibung: | Literaturverz. S. 183 - 189 |
| Beschreibung: | XV, 196 S. graph. Darst. : 24 cm |
| ISBN: | 3540414924 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV013586456 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 010206s2000 gw d||| |||| 00||| eng d | ||
| 016 | 7 | |a 96027863X |2 DE-101 | |
| 020 | |a 3540414924 |c kart. : DM 62.00 |9 3-540-41492-4 | ||
| 035 | |a (DE-599)BVBBV013586456 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 100 | 1 | |a Van Melkebeek, Dieter |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Randomness and completeness in computational complexity |c Dieter VanMelkebeek. [Association for Computing Machinery] |
| 264 | 1 | |a Berlin ; Heidelberg ; New York ; Barcelona ; Hong Kong ; London |b Springer |c 2000 | |
| 300 | |a XV, 196 S. |b graph. Darst. : 24 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Lecture notes in computer science |v Vol. 1950 | |
| 500 | |a Literaturverz. S. 183 - 189 | ||
| 650 | 0 | 7 | |a Randomisierung |0 (DE-588)4280827-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a NP-vollständiges Problem |0 (DE-588)4138229-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a P-vollständiges Problem |0 (DE-588)4395792-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
| 655 | 7 | |8 1\p |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a NP-vollständiges Problem |0 (DE-588)4138229-8 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a P-vollständiges Problem |0 (DE-588)4395792-4 |D s |
| 689 | 2 | |5 DE-604 | |
| 689 | 3 | 0 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 3 | 1 | |a Randomisierung |0 (DE-588)4280827-3 |D s |
| 689 | 3 | |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-009279492 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804128389085265921 |
|---|---|
| any_adam_object | |
| author | Van Melkebeek, Dieter |
| author_facet | Van Melkebeek, Dieter |
| author_role | aut |
| author_sort | Van Melkebeek, Dieter |
| author_variant | m d v md mdv |
| building | Verbundindex |
| bvnumber | BV013586456 |
| ctrlnum | (DE-599)BVBBV013586456 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01800nam a2200457 cb4500</leader><controlfield tag="001">BV013586456</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">010206s2000 gw d||| |||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">96027863X</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540414924</subfield><subfield code="c">kart. : DM 62.00</subfield><subfield code="9">3-540-41492-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV013586456</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Van Melkebeek, Dieter</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Randomness and completeness in computational complexity</subfield><subfield code="c">Dieter VanMelkebeek. [Association for Computing Machinery]</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin ; Heidelberg ; New York ; Barcelona ; Hong Kong ; London</subfield><subfield code="b">Springer</subfield><subfield code="c">2000</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XV, 196 S.</subfield><subfield code="b">graph. Darst. : 24 cm</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="0" ind2=" "><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">Vol. 1950</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. S. 183 - 189</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Randomisierung</subfield><subfield code="0">(DE-588)4280827-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">NP-vollständiges Problem</subfield><subfield code="0">(DE-588)4138229-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">P-vollständiges Problem</subfield><subfield code="0">(DE-588)4395792-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><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">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</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">NP-vollständiges Problem</subfield><subfield code="0">(DE-588)4138229-8</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">P-vollständiges Problem</subfield><subfield code="0">(DE-588)4395792-4</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">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2="1"><subfield code="a">Randomisierung</subfield><subfield code="0">(DE-588)4280827-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-009279492</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| genre | 1\p (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV013586456 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T18:48:28Z |
| institution | BVB |
| isbn | 3540414924 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-009279492 |
| open_access_boolean | |
| physical | XV, 196 S. graph. Darst. : 24 cm |
| publishDate | 2000 |
| publishDateSearch | 2000 |
| publishDateSort | 2000 |
| publisher | Springer |
| record_format | marc |
| series2 | Lecture notes in computer science |
| spelling | Van Melkebeek, Dieter Verfasser aut Randomness and completeness in computational complexity Dieter VanMelkebeek. [Association for Computing Machinery] Berlin ; Heidelberg ; New York ; Barcelona ; Hong Kong ; London Springer 2000 XV, 196 S. graph. Darst. : 24 cm txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science Vol. 1950 Literaturverz. S. 183 - 189 Randomisierung (DE-588)4280827-3 gnd rswk-swf NP-vollständiges Problem (DE-588)4138229-8 gnd rswk-swf P-vollständiges Problem (DE-588)4395792-4 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf 1\p (DE-588)4113937-9 Hochschulschrift gnd-content Berechnungskomplexität (DE-588)4134751-1 s DE-604 NP-vollständiges Problem (DE-588)4138229-8 s P-vollständiges Problem (DE-588)4395792-4 s Randomisierung (DE-588)4280827-3 s 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Van Melkebeek, Dieter Randomness and completeness in computational complexity Randomisierung (DE-588)4280827-3 gnd NP-vollständiges Problem (DE-588)4138229-8 gnd P-vollständiges Problem (DE-588)4395792-4 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| subject_GND | (DE-588)4280827-3 (DE-588)4138229-8 (DE-588)4395792-4 (DE-588)4134751-1 (DE-588)4113937-9 |
| title | Randomness and completeness in computational complexity |
| title_auth | Randomness and completeness in computational complexity |
| title_exact_search | Randomness and completeness in computational complexity |
| title_full | Randomness and completeness in computational complexity Dieter VanMelkebeek. [Association for Computing Machinery] |
| title_fullStr | Randomness and completeness in computational complexity Dieter VanMelkebeek. [Association for Computing Machinery] |
| title_full_unstemmed | Randomness and completeness in computational complexity Dieter VanMelkebeek. [Association for Computing Machinery] |
| title_short | Randomness and completeness in computational complexity |
| title_sort | randomness and completeness in computational complexity |
| topic | Randomisierung (DE-588)4280827-3 gnd NP-vollständiges Problem (DE-588)4138229-8 gnd P-vollständiges Problem (DE-588)4395792-4 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| topic_facet | Randomisierung NP-vollständiges Problem P-vollständiges Problem Berechnungskomplexität Hochschulschrift |
| work_keys_str_mv | AT vanmelkebeekdieter randomnessandcompletenessincomputationalcomplexity |