Randomness and completeness in computational complexity:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2000
|
| Schriftenreihe: | Lecture notes in computer science
1950 |
| Schlagworte: | |
| Online-Zugang: | DE-91 DE-384 DE-19 DE-739 Volltext |
| Beschreibung: | Zugl.: Chicago, Univ., Diss., 1999 |
| Beschreibung: | 1 Online-Ressource (XV, 196 S.) |
| ISBN: | 3540414924 9783540414926 |
| DOI: | 10.1007/3-540-44545-5 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV035105614 | ||
| 003 | DE-604 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 081017s2000 xx om||| 00||| eng d | ||
| 020 | |a 3540414924 |9 3-540-41492-4 | ||
| 020 | |a 9783540414926 |9 978-3-540-41492-6 | ||
| 024 | 7 | |a 10.1007/3-540-44545-5 |2 doi | |
| 035 | |a (OCoLC)873561710 | ||
| 035 | |a (DE-599)BVBBV035105614 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-19 |a DE-91 |a DE-739 |a DE-384 | ||
| 084 | |a DAT 542f |2 stub | ||
| 084 | |a DAT 512f |2 stub | ||
| 100 | 1 | |a Van Melkebeek, Dieter |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Randomness and completeness in computational complexity |c Dieter van Melkebeek |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2000 | |
| 300 | |a 1 Online-Ressource (XV, 196 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 1950 | |
| 500 | |a Zugl.: Chicago, Univ., Diss., 1999 | ||
| 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 Randomisierung |0 (DE-588)4280827-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
| 655 | 7 | |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 | |
| 830 | 0 | |a Lecture notes in computer science |v 1950 |w (DE-604)BV014880109 |9 1950 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/3-540-44545-5 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-LNC | ||
| 912 | |a ebook | ||
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-016773530 | |
| 966 | e | |u https://doi.org/10.1007/3-540-44545-5 |l DE-91 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/3-540-44545-5 |l DE-384 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/3-540-44545-5 |l DE-19 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/3-540-44545-5 |l DE-739 |p ZDB-2-LNC |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1820875079285735424 |
|---|---|
| adam_text | |
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| 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 | BV035105614 |
| classification_rvk | SS 4800 |
| classification_tum | DAT 542f DAT 512f |
| collection | ZDB-2-LNC ebook |
| ctrlnum | (OCoLC)873561710 (DE-599)BVBBV035105614 |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| doi_str_mv | 10.1007/3-540-44545-5 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV035105614</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">081017s2000 xx om||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540414924</subfield><subfield code="9">3-540-41492-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783540414926</subfield><subfield code="9">978-3-540-41492-6</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/3-540-44545-5</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)873561710</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV035105614</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-19</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-384</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 542f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 512f</subfield><subfield code="2">stub</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 van Melkebeek</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2000</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XV, 196 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">1950</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Chicago, Univ., Diss., 1999</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">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">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="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="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">1950</subfield><subfield code="w">(DE-604)BV014880109</subfield><subfield code="9">1950</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/3-540-44545-5</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-LNC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ebook</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-016773530</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/3-540-44545-5</subfield><subfield code="l">DE-91</subfield><subfield code="p">ZDB-2-LNC</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/3-540-44545-5</subfield><subfield code="l">DE-384</subfield><subfield code="p">ZDB-2-LNC</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/3-540-44545-5</subfield><subfield code="l">DE-19</subfield><subfield code="p">ZDB-2-LNC</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/3-540-44545-5</subfield><subfield code="l">DE-739</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV035105614 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T22:15:49Z |
| indexdate | 2025-01-10T15:09:56Z |
| institution | BVB |
| isbn | 3540414924 9783540414926 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016773530 |
| oclc_num | 873561710 |
| open_access_boolean | |
| owner | DE-19 DE-BY-UBM DE-91 DE-BY-TUM DE-739 DE-384 |
| owner_facet | DE-19 DE-BY-UBM DE-91 DE-BY-TUM DE-739 DE-384 |
| physical | 1 Online-Ressource (XV, 196 S.) |
| psigel | ZDB-2-LNC ebook |
| publishDate | 2000 |
| publishDateSearch | 2000 |
| publishDateSort | 2000 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | Van Melkebeek, Dieter Verfasser aut Randomness and completeness in computational complexity Dieter van Melkebeek Berlin [u.a.] Springer 2000 1 Online-Ressource (XV, 196 S.) txt rdacontent c rdamedia cr rdacarrier Lecture notes in computer science 1950 Zugl.: Chicago, Univ., Diss., 1999 NP-vollständiges Problem (DE-588)4138229-8 gnd rswk-swf P-vollständiges Problem (DE-588)4395792-4 gnd rswk-swf Randomisierung (DE-588)4280827-3 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf (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 Lecture notes in computer science 1950 (DE-604)BV014880109 1950 https://doi.org/10.1007/3-540-44545-5 Verlag Volltext |
| spellingShingle | Van Melkebeek, Dieter Randomness and completeness in computational complexity Lecture notes in computer science NP-vollständiges Problem (DE-588)4138229-8 gnd P-vollständiges Problem (DE-588)4395792-4 gnd Randomisierung (DE-588)4280827-3 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| subject_GND | (DE-588)4138229-8 (DE-588)4395792-4 (DE-588)4280827-3 (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_exact_search_txtP | Randomness and completeness in computational complexity |
| title_full | Randomness and completeness in computational complexity Dieter van Melkebeek |
| title_fullStr | Randomness and completeness in computational complexity Dieter van Melkebeek |
| title_full_unstemmed | Randomness and completeness in computational complexity Dieter van Melkebeek |
| title_short | Randomness and completeness in computational complexity |
| title_sort | randomness and completeness in computational complexity |
| topic | NP-vollständiges Problem (DE-588)4138229-8 gnd P-vollständiges Problem (DE-588)4395792-4 gnd Randomisierung (DE-588)4280827-3 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| topic_facet | NP-vollständiges Problem P-vollständiges Problem Randomisierung Berechnungskomplexität Hochschulschrift |
| url | https://doi.org/10.1007/3-540-44545-5 |
| volume_link | (DE-604)BV014880109 |
| work_keys_str_mv | AT vanmelkebeekdieter randomnessandcompletenessincomputationalcomplexity |