Computers and intractability: a guide to the theory of NP-Completeness
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
San Francisco
Freeman
1979
|
| Ausgabe: | 1. print. |
| Schriftenreihe: | Series of books in the mathematical sciences
|
| Schlagworte: | |
| Beschreibung: | 338 S. |
| ISBN: | 0716710455 0716710447 |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021926659 | ||
| 003 | DE-604 | ||
| 005 | 20040301000000.0 | ||
| 007 | t| | ||
| 008 | 950927s1979 xx |||| 00||| eng d | ||
| 020 | |a 0716710455 |9 0-7167-1045-5 | ||
| 020 | |a 0716710447 |9 0-7167-1044-7 | ||
| 035 | |a (OCoLC)4195125 | ||
| 035 | |a (DE-599)BVBBV021926659 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 050 | 0 | |a QA76.6 | |
| 082 | 0 | |a 519.4 | |
| 084 | |a ST 230 |0 (DE-625)143617: |2 rvk | ||
| 100 | 1 | |a Garey, Michael R. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Computers and intractability |b a guide to the theory of NP-Completeness |
| 250 | |a 1. print. | ||
| 264 | 1 | |a San Francisco |b Freeman |c 1979 | |
| 300 | |a 338 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Series of books in the mathematical sciences | |
| 650 | 4 | |a Algorithmes | |
| 650 | 7 | |a Algoritmen |2 gtt | |
| 650 | 7 | |a Complexiteit |2 gtt | |
| 650 | 4 | |a Complexité de calcul (Informatique) | |
| 650 | 7 | |a Matemática da computação |2 larpcal | |
| 650 | 4 | |a Programmation (Informatique) | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Computer algorithms | |
| 650 | 4 | |a Computer programming | |
| 650 | 0 | 7 | |a Grundlage |0 (DE-588)4158388-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Neurolinguistisches Programmieren |0 (DE-588)4192909-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Datenverarbeitung |0 (DE-588)4011152-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Altkirchenslawisch |0 (DE-588)4085065-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Mathematik |0 (DE-588)4037944-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Programmierung |0 (DE-588)4076370-5 |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 Komplexität |0 (DE-588)4135369-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 651 | 7 | |a Fischkaltersee |0 (DE-588)4017327-6 |2 gnd |9 rswk-swf | |
| 651 | 7 | |a Chittagong Hill Tracts |0 (DE-588)4010001-7 |2 gnd |9 rswk-swf | |
| 651 | 7 | |a Alaska |0 (DE-588)4001016-8 |2 gnd |9 rswk-swf | |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Programmierung |0 (DE-588)4076370-5 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Komplexität |0 (DE-588)4135369-9 |D s |
| 689 | 2 | |5 DE-604 | |
| 689 | 3 | 0 | |a Datenverarbeitung |0 (DE-588)4011152-0 |D s |
| 689 | 3 | 1 | |a Mathematik |0 (DE-588)4037944-9 |D s |
| 689 | 3 | 2 | |a Grundlage |0 (DE-588)4158388-7 |D s |
| 689 | 3 | |8 1\p |5 DE-604 | |
| 689 | 4 | 0 | |a Altkirchenslawisch |0 (DE-588)4085065-1 |D s |
| 689 | 4 | 1 | |a Alaska |0 (DE-588)4001016-8 |D g |
| 689 | 4 | 2 | |a Fischkaltersee |0 (DE-588)4017327-6 |D g |
| 689 | 4 | |8 2\p |5 DE-604 | |
| 689 | 5 | 0 | |a Datenverarbeitung |0 (DE-588)4011152-0 |D s |
| 689 | 5 | 1 | |a Neurolinguistisches Programmieren |0 (DE-588)4192909-3 |D s |
| 689 | 5 | |8 3\p |5 DE-604 | |
| 689 | 6 | 0 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 6 | |8 4\p |5 DE-604 | |
| 689 | 7 | 0 | |a NP-vollständiges Problem |0 (DE-588)4138229-8 |D s |
| 689 | 7 | |8 5\p |5 DE-604 | |
| 689 | 8 | 0 | |a Chittagong Hill Tracts |0 (DE-588)4010001-7 |D g |
| 689 | 8 | |8 6\p |5 DE-604 | |
| 700 | 1 | |a Johnson, David S. |e Verfasser |4 aut | |
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 4\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 5\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 6\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-015141816 | |
Datensatz im Suchindex
| _version_ | 1818768283451523072 |
|---|---|
| adam_text | |
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Garey, Michael R. Johnson, David S. |
| author_facet | Garey, Michael R. Johnson, David S. |
| author_role | aut aut |
| author_sort | Garey, Michael R. |
| author_variant | m r g mr mrg d s j ds dsj |
| building | Verbundindex |
| bvnumber | BV021926659 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.6 |
| callnumber-search | QA76.6 |
| callnumber-sort | QA 276.6 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 230 |
| ctrlnum | (OCoLC)4195125 (DE-599)BVBBV021926659 |
| dewey-full | 519.4 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 519 - Probabilities and applied mathematics |
| dewey-raw | 519.4 |
| dewey-search | 519.4 |
| dewey-sort | 3519.4 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| discipline_str_mv | Informatik Mathematik |
| edition | 1. print. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000zc 4500</leader><controlfield tag="001">BV021926659</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040301000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">950927s1979 xx |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0716710455</subfield><subfield code="9">0-7167-1045-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0716710447</subfield><subfield code="9">0-7167-1044-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)4195125</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021926659</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.6</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.4</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 230</subfield><subfield code="0">(DE-625)143617:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Garey, Michael R.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computers and intractability</subfield><subfield code="b">a guide to the theory of NP-Completeness</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. print.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">San Francisco</subfield><subfield code="b">Freeman</subfield><subfield code="c">1979</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">338 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="0" ind2=" "><subfield code="a">Series of books in the mathematical sciences</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmes</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algoritmen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Complexiteit</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexité de calcul (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Matemática da computação</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programmation (Informatique)</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 algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programming</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Grundlage</subfield><subfield code="0">(DE-588)4158388-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Neurolinguistisches Programmieren</subfield><subfield code="0">(DE-588)4192909-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Altkirchenslawisch</subfield><subfield code="0">(DE-588)4085065-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</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">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</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="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="651" ind1=" " ind2="7"><subfield code="a">Fischkaltersee</subfield><subfield code="0">(DE-588)4017327-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="651" ind1=" " ind2="7"><subfield code="a">Chittagong Hill Tracts</subfield><subfield code="0">(DE-588)4010001-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="651" ind1=" " ind2="7"><subfield code="a">Alaska</subfield><subfield code="0">(DE-588)4001016-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><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">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</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">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</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">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2="1"><subfield code="a">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2="2"><subfield code="a">Grundlage</subfield><subfield code="0">(DE-588)4158388-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" ind2="0"><subfield code="a">Altkirchenslawisch</subfield><subfield code="0">(DE-588)4085065-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2="1"><subfield code="a">Alaska</subfield><subfield code="0">(DE-588)4001016-8</subfield><subfield code="D">g</subfield></datafield><datafield tag="689" ind1="4" ind2="2"><subfield code="a">Fischkaltersee</subfield><subfield code="0">(DE-588)4017327-6</subfield><subfield code="D">g</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="5" ind2="0"><subfield code="a">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" ind2="1"><subfield code="a">Neurolinguistisches Programmieren</subfield><subfield code="0">(DE-588)4192909-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="6" 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="6" ind2=" "><subfield code="8">4\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="7" 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="7" ind2=" "><subfield code="8">5\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="8" ind2="0"><subfield code="a">Chittagong Hill Tracts</subfield><subfield code="0">(DE-588)4010001-7</subfield><subfield code="D">g</subfield></datafield><datafield tag="689" ind1="8" ind2=" "><subfield code="8">6\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Johnson, David S.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</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><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\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><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\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><datafield tag="883" ind1="1" ind2=" "><subfield code="8">4\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><datafield tag="883" ind1="1" ind2=" "><subfield code="8">5\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><datafield tag="883" ind1="1" ind2=" "><subfield code="8">6\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><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015141816</subfield></datafield></record></collection> |
| geographic | Fischkaltersee (DE-588)4017327-6 gnd Chittagong Hill Tracts (DE-588)4010001-7 gnd Alaska (DE-588)4001016-8 gnd |
| geographic_facet | Fischkaltersee Chittagong Hill Tracts Alaska |
| id | DE-604.BV021926659 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T16:06:01Z |
| indexdate | 2024-12-18T09:03:19Z |
| institution | BVB |
| isbn | 0716710455 0716710447 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015141816 |
| oclc_num | 4195125 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 338 S. |
| publishDate | 1979 |
| publishDateSearch | 1979 |
| publishDateSort | 1979 |
| publisher | Freeman |
| record_format | marc |
| series2 | Series of books in the mathematical sciences |
| spelling | Garey, Michael R. Verfasser aut Computers and intractability a guide to the theory of NP-Completeness 1. print. San Francisco Freeman 1979 338 S. txt rdacontent n rdamedia nc rdacarrier Series of books in the mathematical sciences Algorithmes Algoritmen gtt Complexiteit gtt Complexité de calcul (Informatique) Matemática da computação larpcal Programmation (Informatique) Computational complexity Computer algorithms Computer programming Grundlage (DE-588)4158388-7 gnd rswk-swf Neurolinguistisches Programmieren (DE-588)4192909-3 gnd rswk-swf Datenverarbeitung (DE-588)4011152-0 gnd rswk-swf Altkirchenslawisch (DE-588)4085065-1 gnd rswk-swf Mathematik (DE-588)4037944-9 gnd rswk-swf Programmierung (DE-588)4076370-5 gnd rswk-swf NP-vollständiges Problem (DE-588)4138229-8 gnd rswk-swf Komplexität (DE-588)4135369-9 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Fischkaltersee (DE-588)4017327-6 gnd rswk-swf Chittagong Hill Tracts (DE-588)4010001-7 gnd rswk-swf Alaska (DE-588)4001016-8 gnd rswk-swf Algorithmus (DE-588)4001183-5 s DE-604 Programmierung (DE-588)4076370-5 s Komplexität (DE-588)4135369-9 s Datenverarbeitung (DE-588)4011152-0 s Mathematik (DE-588)4037944-9 s Grundlage (DE-588)4158388-7 s 1\p DE-604 Altkirchenslawisch (DE-588)4085065-1 s Alaska (DE-588)4001016-8 g Fischkaltersee (DE-588)4017327-6 g 2\p DE-604 Neurolinguistisches Programmieren (DE-588)4192909-3 s 3\p DE-604 Berechnungskomplexität (DE-588)4134751-1 s 4\p DE-604 NP-vollständiges Problem (DE-588)4138229-8 s 5\p DE-604 Chittagong Hill Tracts (DE-588)4010001-7 g 6\p DE-604 Johnson, David S. Verfasser aut 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 4\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 5\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 6\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Garey, Michael R. Johnson, David S. Computers and intractability a guide to the theory of NP-Completeness Algorithmes Algoritmen gtt Complexiteit gtt Complexité de calcul (Informatique) Matemática da computação larpcal Programmation (Informatique) Computational complexity Computer algorithms Computer programming Grundlage (DE-588)4158388-7 gnd Neurolinguistisches Programmieren (DE-588)4192909-3 gnd Datenverarbeitung (DE-588)4011152-0 gnd Altkirchenslawisch (DE-588)4085065-1 gnd Mathematik (DE-588)4037944-9 gnd Programmierung (DE-588)4076370-5 gnd NP-vollständiges Problem (DE-588)4138229-8 gnd Komplexität (DE-588)4135369-9 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4158388-7 (DE-588)4192909-3 (DE-588)4011152-0 (DE-588)4085065-1 (DE-588)4037944-9 (DE-588)4076370-5 (DE-588)4138229-8 (DE-588)4135369-9 (DE-588)4134751-1 (DE-588)4001183-5 (DE-588)4017327-6 (DE-588)4010001-7 (DE-588)4001016-8 |
| title | Computers and intractability a guide to the theory of NP-Completeness |
| title_auth | Computers and intractability a guide to the theory of NP-Completeness |
| title_exact_search | Computers and intractability a guide to the theory of NP-Completeness |
| title_exact_search_txtP | Computers and intractability a guide to the theory of NP-Completeness |
| title_full | Computers and intractability a guide to the theory of NP-Completeness |
| title_fullStr | Computers and intractability a guide to the theory of NP-Completeness |
| title_full_unstemmed | Computers and intractability a guide to the theory of NP-Completeness |
| title_short | Computers and intractability |
| title_sort | computers and intractability a guide to the theory of np completeness |
| title_sub | a guide to the theory of NP-Completeness |
| topic | Algorithmes Algoritmen gtt Complexiteit gtt Complexité de calcul (Informatique) Matemática da computação larpcal Programmation (Informatique) Computational complexity Computer algorithms Computer programming Grundlage (DE-588)4158388-7 gnd Neurolinguistisches Programmieren (DE-588)4192909-3 gnd Datenverarbeitung (DE-588)4011152-0 gnd Altkirchenslawisch (DE-588)4085065-1 gnd Mathematik (DE-588)4037944-9 gnd Programmierung (DE-588)4076370-5 gnd NP-vollständiges Problem (DE-588)4138229-8 gnd Komplexität (DE-588)4135369-9 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Algorithmes Algoritmen Complexiteit Complexité de calcul (Informatique) Matemática da computação Programmation (Informatique) Computational complexity Computer algorithms Computer programming Grundlage Neurolinguistisches Programmieren Datenverarbeitung Altkirchenslawisch Mathematik Programmierung NP-vollständiges Problem Komplexität Berechnungskomplexität Algorithmus Fischkaltersee Chittagong Hill Tracts Alaska |
| work_keys_str_mv | AT gareymichaelr computersandintractabilityaguidetothetheoryofnpcompleteness AT johnsondavids computersandintractabilityaguidetothetheoryofnpcompleteness |