Randomness and completeness in computational complexity:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2000
|
| Schriftenreihe: | Lecture notes in computer science
1950 |
| Schlagworte: | |
| Beschreibung: | XV, 196 S. |
| ISBN: | 3540414924 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV013507693 | ||
| 003 | DE-604 | ||
| 005 | 20170620 | ||
| 007 | t| | ||
| 008 | 001228s2000 xx m||| 00||| eng d | ||
| 020 | |a 3540414924 |9 3-540-41492-4 | ||
| 035 | |a (OCoLC)45582464 | ||
| 035 | |a (DE-599)BVBBV013507693 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G |a DE-384 |a DE-739 |a DE-20 |a DE-634 |a DE-83 |a DE-188 |a DE-706 | ||
| 050 | 0 | |a QA76.9.M35 | |
| 082 | 0 | |a 004/.01/51 |2 21 | |
| 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 XV, 196 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 1950 | |
| 502 | |a Zugl.: Chicago, Univ., Diss., 1999 (rev. version) | ||
| 650 | 4 | |a Complexité de calcul (Informatique) | |
| 650 | 4 | |a Informatique - Mathématiques | |
| 650 | 4 | |a Informatik | |
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Computer science |x Mathematics | |
| 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)BV000000607 |9 1950 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-009221129 | |
Datensatz im Suchindex
| _version_ | 1820874899472777216 |
|---|---|
| adam_text | |
| 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 | BV013507693 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.9.M35 |
| callnumber-search | QA76.9.M35 |
| callnumber-sort | QA 276.9 M35 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SS 4800 |
| classification_tum | DAT 542f DAT 512f |
| ctrlnum | (OCoLC)45582464 (DE-599)BVBBV013507693 |
| dewey-full | 004/.01/51 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004/.01/51 |
| dewey-search | 004/.01/51 |
| dewey-sort | 14 11 251 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Thesis Book |
| 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">BV013507693</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20170620</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">001228s2000 xx m||| 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="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)45582464</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV013507693</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-91G</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-706</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.9.M35</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004/.01/51</subfield><subfield code="2">21</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">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">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">Lecture notes in computer science</subfield><subfield code="v">1950</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Zugl.: Chicago, Univ., Diss., 1999 (rev. version)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexité de calcul (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatique - Mathématiques</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield><subfield code="x">Mathematics</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)BV000000607</subfield><subfield code="9">1950</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-009221129</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV013507693 |
| illustrated | Not Illustrated |
| indexdate | 2025-01-10T15:07:04Z |
| institution | BVB |
| isbn | 3540414924 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-009221129 |
| oclc_num | 45582464 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-384 DE-739 DE-20 DE-634 DE-83 DE-188 DE-706 |
| owner_facet | DE-91G DE-BY-TUM DE-384 DE-739 DE-20 DE-634 DE-83 DE-188 DE-706 |
| physical | XV, 196 S. |
| 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 XV, 196 S. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 1950 Zugl.: Chicago, Univ., Diss., 1999 (rev. version) Complexité de calcul (Informatique) Informatique - Mathématiques Informatik Mathematik Computational complexity Computer science Mathematics 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)BV000000607 1950 |
| spellingShingle | Van Melkebeek, Dieter Randomness and completeness in computational complexity Lecture notes in computer science Complexité de calcul (Informatique) Informatique - Mathématiques Informatik Mathematik Computational complexity Computer science Mathematics 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_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 | Complexité de calcul (Informatique) Informatique - Mathématiques Informatik Mathematik Computational complexity Computer science Mathematics 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 | Complexité de calcul (Informatique) Informatique - Mathématiques Informatik Mathematik Computational complexity Computer science Mathematics NP-vollständiges Problem P-vollständiges Problem Randomisierung Berechnungskomplexität Hochschulschrift |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT vanmelkebeekdieter randomnessandcompletenessincomputationalcomplexity |