Lectures on proof verification and approximation algorithms:
Gespeichert in:
| Format: | Elektronisch E-Book |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
1998
|
| Schriftenreihe: | Lecture notes in computer science
1367 |
| Schlagworte: | |
| Online-Zugang: | TUM01 UBA01 UBM01 UPA01 Volltext |
| Beschreibung: | 1 Online-Ressource (XII, 344 S.) graph. Darst. |
| ISBN: | 3540642013 |
| DOI: | 10.1007/BFb0053010 |
Internformat
MARC
| LEADER | 00000nmm a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV035075231 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 006 | a |||| 10||| | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 080929s1998 gw |||| o||u| ||||||eng d | ||
| 020 | |a 3540642013 |c kart. : DM 82.00 |9 3-540-64201-3 | ||
| 024 | 7 | |a 10.1007/BFb0053010 |2 doi | |
| 035 | |a (OCoLC)873553532 | ||
| 035 | |a (DE-599)BVBBV035075231 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-19 |a DE-91 |a DE-739 |a DE-384 | ||
| 084 | |a SS 4800 |0 (DE-625)143528: |2 rvk | ||
| 084 | |a DAT 532f |2 stub | ||
| 245 | 1 | 0 | |a Lectures on proof verification and approximation algorithms |c Ernst W. Mayr ... (ed.) |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 1998 | |
| 300 | |a 1 Online-Ressource (XII, 344 S.) |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 1367 | |
| 650 | 0 | 7 | |a Probabilistisch verifizierbarer Beweis |0 (DE-588)4500953-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Approximation |0 (DE-588)4002498-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Komplexitätsklasse NP |0 (DE-588)4500955-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Optimierungsproblem |0 (DE-588)4390818-4 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Approximation |0 (DE-588)4002498-2 |D s |
| 689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Optimierungsproblem |0 (DE-588)4390818-4 |D s |
| 689 | 1 | 1 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |D s |
| 689 | 1 | 2 | |a Komplexitätsklasse NP |0 (DE-588)4500955-7 |D s |
| 689 | 1 | 3 | |a Probabilistisch verifizierbarer Beweis |0 (DE-588)4500953-3 |D s |
| 689 | 1 | |5 DE-604 | |
| 700 | 1 | |a Mayr, Ernst W. |d 1950- |e Sonstige |0 (DE-588)109817923 |4 oth | |
| 830 | 0 | |a Lecture notes in computer science |v 1367 |w (DE-604)BV014880109 |9 1367 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/BFb0053010 |3 Volltext |
| 912 | |a ZDB-2-LNC | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-016743564 | ||
| 966 | e | |u https://doi.org/10.1007/BFb0053010 |l TUM01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/BFb0053010 |l UBA01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/BFb0053010 |l UBM01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/BFb0053010 |l UPA01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804138025120169984 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author_GND | (DE-588)109817923 |
| building | Verbundindex |
| bvnumber | BV035075231 |
| classification_rvk | SS 4800 |
| classification_tum | DAT 532f |
| collection | ZDB-2-LNC |
| ctrlnum | (OCoLC)873553532 (DE-599)BVBBV035075231 |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| doi_str_mv | 10.1007/BFb0053010 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02491nmm a2200589 cb4500</leader><controlfield tag="001">BV035075231</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="006">a |||| 10||| </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">080929s1998 gw |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540642013</subfield><subfield code="c">kart. : DM 82.00</subfield><subfield code="9">3-540-64201-3</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/BFb0053010</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)873553532</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV035075231</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="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">SS 4800</subfield><subfield code="0">(DE-625)143528:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 532f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Lectures on proof verification and approximation algorithms</subfield><subfield code="c">Ernst W. Mayr ... (ed.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">1998</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XII, 344 S.)</subfield><subfield code="b">graph. Darst.</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">1367</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Probabilistisch verifizierbarer Beweis</subfield><subfield code="0">(DE-588)4500953-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Approximation</subfield><subfield code="0">(DE-588)4002498-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexitätsklasse NP</subfield><subfield code="0">(DE-588)4500955-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Optimierungsproblem</subfield><subfield code="0">(DE-588)4390818-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Approximation</subfield><subfield code="0">(DE-588)4002498-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</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">Optimierungsproblem</subfield><subfield code="0">(DE-588)4390818-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><subfield code="a">Komplexitätsklasse NP</subfield><subfield code="0">(DE-588)4500955-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="3"><subfield code="a">Probabilistisch verifizierbarer Beweis</subfield><subfield code="0">(DE-588)4500953-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Mayr, Ernst W.</subfield><subfield code="d">1950-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)109817923</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">1367</subfield><subfield code="w">(DE-604)BV014880109</subfield><subfield code="9">1367</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/BFb0053010</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-LNC</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-016743564</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/BFb0053010</subfield><subfield code="l">TUM01</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/BFb0053010</subfield><subfield code="l">UBA01</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/BFb0053010</subfield><subfield code="l">UBM01</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/BFb0053010</subfield><subfield code="l">UPA01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift gnd-content |
| genre_facet | Konferenzschrift |
| id | DE-604.BV035075231 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T22:05:19Z |
| indexdate | 2024-07-09T21:21:37Z |
| institution | BVB |
| isbn | 3540642013 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016743564 |
| oclc_num | 873553532 |
| 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 (XII, 344 S.) graph. Darst. |
| psigel | ZDB-2-LNC |
| publishDate | 1998 |
| publishDateSearch | 1998 |
| publishDateSort | 1998 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | Lectures on proof verification and approximation algorithms Ernst W. Mayr ... (ed.) Berlin [u.a.] Springer 1998 1 Online-Ressource (XII, 344 S.) graph. Darst. txt rdacontent c rdamedia cr rdacarrier Lecture notes in computer science 1367 Probabilistisch verifizierbarer Beweis (DE-588)4500953-3 gnd rswk-swf Approximation (DE-588)4002498-2 gnd rswk-swf Komplexitätsklasse NP (DE-588)4500955-7 gnd rswk-swf Approximationsalgorithmus (DE-588)4500954-5 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Optimierungsproblem (DE-588)4390818-4 gnd rswk-swf (DE-588)1071861417 Konferenzschrift gnd-content Approximation (DE-588)4002498-2 s Algorithmus (DE-588)4001183-5 s DE-604 Optimierungsproblem (DE-588)4390818-4 s Approximationsalgorithmus (DE-588)4500954-5 s Komplexitätsklasse NP (DE-588)4500955-7 s Probabilistisch verifizierbarer Beweis (DE-588)4500953-3 s Mayr, Ernst W. 1950- Sonstige (DE-588)109817923 oth Lecture notes in computer science 1367 (DE-604)BV014880109 1367 https://doi.org/10.1007/BFb0053010 Volltext |
| spellingShingle | Lectures on proof verification and approximation algorithms Lecture notes in computer science Probabilistisch verifizierbarer Beweis (DE-588)4500953-3 gnd Approximation (DE-588)4002498-2 gnd Komplexitätsklasse NP (DE-588)4500955-7 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Algorithmus (DE-588)4001183-5 gnd Optimierungsproblem (DE-588)4390818-4 gnd |
| subject_GND | (DE-588)4500953-3 (DE-588)4002498-2 (DE-588)4500955-7 (DE-588)4500954-5 (DE-588)4001183-5 (DE-588)4390818-4 (DE-588)1071861417 |
| title | Lectures on proof verification and approximation algorithms |
| title_auth | Lectures on proof verification and approximation algorithms |
| title_exact_search | Lectures on proof verification and approximation algorithms |
| title_exact_search_txtP | Lectures on proof verification and approximation algorithms |
| title_full | Lectures on proof verification and approximation algorithms Ernst W. Mayr ... (ed.) |
| title_fullStr | Lectures on proof verification and approximation algorithms Ernst W. Mayr ... (ed.) |
| title_full_unstemmed | Lectures on proof verification and approximation algorithms Ernst W. Mayr ... (ed.) |
| title_short | Lectures on proof verification and approximation algorithms |
| title_sort | lectures on proof verification and approximation algorithms |
| topic | Probabilistisch verifizierbarer Beweis (DE-588)4500953-3 gnd Approximation (DE-588)4002498-2 gnd Komplexitätsklasse NP (DE-588)4500955-7 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Algorithmus (DE-588)4001183-5 gnd Optimierungsproblem (DE-588)4390818-4 gnd |
| topic_facet | Probabilistisch verifizierbarer Beweis Approximation Komplexitätsklasse NP Approximationsalgorithmus Algorithmus Optimierungsproblem Konferenzschrift |
| url | https://doi.org/10.1007/BFb0053010 |
| volume_link | (DE-604)BV014880109 |
| work_keys_str_mv | AT mayrernstw lecturesonproofverificationandapproximationalgorithms |