The golden ticket: P, NP, and the search for the impossible
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Princetown [u.a.]
Princetown Univ. Press
2013
|
| Schlagworte: | |
| Beschreibung: | Literaturverz. S. [165] - 169 |
| Beschreibung: | X, 176 S. Ill., graf. Darst., Kt. |
| ISBN: | 9780691156491 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV041109305 | ||
| 003 | DE-604 | ||
| 005 | 20150205 | ||
| 007 | t | ||
| 008 | 130626s2013 ab|| |||| 00||| eng d | ||
| 010 | |a 2012039523 | ||
| 020 | |a 9780691156491 |c hardback |9 978-0-691-15649-1 | ||
| 035 | |a (OCoLC)843345968 | ||
| 035 | |a (DE-599)GBV733346669 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-83 |a DE-703 |a DE-19 | ||
| 082 | 0 | |a 511.3/52 | |
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 100 | 1 | |a Fortnow, Lance |d 1963- |e Verfasser |0 (DE-588)1034850725 |4 aut | |
| 245 | 1 | 0 | |a The golden ticket |b P, NP, and the search for the impossible |c Lance Fortnow |
| 264 | 1 | |a Princetown [u.a.] |b Princetown Univ. Press |c 2013 | |
| 300 | |a X, 176 S. |b Ill., graf. Darst., Kt. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Literaturverz. S. [165] - 169 | ||
| 650 | 0 | 7 | |a Computer |0 (DE-588)4070083-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Polynomialzeitalgorithmus |0 (DE-588)4199652-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 Ungelöstes Problem |0 (DE-588)4186869-9 |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 P-vollständiges Problem |0 (DE-588)4395792-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Programmanalyse |0 (DE-588)4175841-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Computer |0 (DE-588)4070083-5 |D s |
| 689 | 0 | 1 | |a Programmanalyse |0 (DE-588)4175841-9 |D s |
| 689 | 0 | 2 | |a P-vollständiges Problem |0 (DE-588)4395792-4 |D s |
| 689 | 0 | 3 | |a NP-vollständiges Problem |0 (DE-588)4138229-8 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Ungelöstes Problem |0 (DE-588)4186869-9 |D s |
| 689 | 1 | 1 | |a Komplexitätsklasse NP |0 (DE-588)4500955-7 |D s |
| 689 | 1 | 2 | |a Polynomialzeitalgorithmus |0 (DE-588)4199652-5 |D s |
| 689 | 1 | |8 1\p |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-026085544 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804150495587074048 |
|---|---|
| any_adam_object | |
| author | Fortnow, Lance 1963- |
| author_GND | (DE-588)1034850725 |
| author_facet | Fortnow, Lance 1963- |
| author_role | aut |
| author_sort | Fortnow, Lance 1963- |
| author_variant | l f lf |
| building | Verbundindex |
| bvnumber | BV041109305 |
| classification_rvk | ST 134 |
| ctrlnum | (OCoLC)843345968 (DE-599)GBV733346669 |
| dewey-full | 511.3/52 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3/52 |
| dewey-search | 511.3/52 |
| dewey-sort | 3511.3 252 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01999nam a2200505 c 4500</leader><controlfield tag="001">BV041109305</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20150205 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">130626s2013 ab|| |||| 00||| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2012039523</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780691156491</subfield><subfield code="c">hardback</subfield><subfield code="9">978-0-691-15649-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)843345968</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBV733346669</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-83</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-19</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3/52</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Fortnow, Lance</subfield><subfield code="d">1963-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1034850725</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The golden ticket</subfield><subfield code="b">P, NP, and the search for the impossible</subfield><subfield code="c">Lance Fortnow</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Princetown [u.a.]</subfield><subfield code="b">Princetown Univ. Press</subfield><subfield code="c">2013</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 176 S.</subfield><subfield code="b">Ill., graf. Darst., Kt.</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="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. S. [165] - 169</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Computer</subfield><subfield code="0">(DE-588)4070083-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Polynomialzeitalgorithmus</subfield><subfield code="0">(DE-588)4199652-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">Ungelöstes Problem</subfield><subfield code="0">(DE-588)4186869-9</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">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">Programmanalyse</subfield><subfield code="0">(DE-588)4175841-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Computer</subfield><subfield code="0">(DE-588)4070083-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Programmanalyse</subfield><subfield code="0">(DE-588)4175841-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><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="0" ind2="3"><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="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Ungelöstes Problem</subfield><subfield code="0">(DE-588)4186869-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><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="2"><subfield code="a">Polynomialzeitalgorithmus</subfield><subfield code="0">(DE-588)4199652-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-026085544</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> |
| id | DE-604.BV041109305 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T00:39:50Z |
| institution | BVB |
| isbn | 9780691156491 |
| language | English |
| lccn | 2012039523 |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-026085544 |
| oclc_num | 843345968 |
| open_access_boolean | |
| owner | DE-83 DE-703 DE-19 DE-BY-UBM |
| owner_facet | DE-83 DE-703 DE-19 DE-BY-UBM |
| physical | X, 176 S. Ill., graf. Darst., Kt. |
| publishDate | 2013 |
| publishDateSearch | 2013 |
| publishDateSort | 2013 |
| publisher | Princetown Univ. Press |
| record_format | marc |
| spelling | Fortnow, Lance 1963- Verfasser (DE-588)1034850725 aut The golden ticket P, NP, and the search for the impossible Lance Fortnow Princetown [u.a.] Princetown Univ. Press 2013 X, 176 S. Ill., graf. Darst., Kt. txt rdacontent n rdamedia nc rdacarrier Literaturverz. S. [165] - 169 Computer (DE-588)4070083-5 gnd rswk-swf Polynomialzeitalgorithmus (DE-588)4199652-5 gnd rswk-swf NP-vollständiges Problem (DE-588)4138229-8 gnd rswk-swf Ungelöstes Problem (DE-588)4186869-9 gnd rswk-swf Komplexitätsklasse NP (DE-588)4500955-7 gnd rswk-swf P-vollständiges Problem (DE-588)4395792-4 gnd rswk-swf Programmanalyse (DE-588)4175841-9 gnd rswk-swf Computer (DE-588)4070083-5 s Programmanalyse (DE-588)4175841-9 s P-vollständiges Problem (DE-588)4395792-4 s NP-vollständiges Problem (DE-588)4138229-8 s DE-604 Ungelöstes Problem (DE-588)4186869-9 s Komplexitätsklasse NP (DE-588)4500955-7 s Polynomialzeitalgorithmus (DE-588)4199652-5 s 1\p DE-604 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Fortnow, Lance 1963- The golden ticket P, NP, and the search for the impossible Computer (DE-588)4070083-5 gnd Polynomialzeitalgorithmus (DE-588)4199652-5 gnd NP-vollständiges Problem (DE-588)4138229-8 gnd Ungelöstes Problem (DE-588)4186869-9 gnd Komplexitätsklasse NP (DE-588)4500955-7 gnd P-vollständiges Problem (DE-588)4395792-4 gnd Programmanalyse (DE-588)4175841-9 gnd |
| subject_GND | (DE-588)4070083-5 (DE-588)4199652-5 (DE-588)4138229-8 (DE-588)4186869-9 (DE-588)4500955-7 (DE-588)4395792-4 (DE-588)4175841-9 |
| title | The golden ticket P, NP, and the search for the impossible |
| title_auth | The golden ticket P, NP, and the search for the impossible |
| title_exact_search | The golden ticket P, NP, and the search for the impossible |
| title_full | The golden ticket P, NP, and the search for the impossible Lance Fortnow |
| title_fullStr | The golden ticket P, NP, and the search for the impossible Lance Fortnow |
| title_full_unstemmed | The golden ticket P, NP, and the search for the impossible Lance Fortnow |
| title_short | The golden ticket |
| title_sort | the golden ticket p np and the search for the impossible |
| title_sub | P, NP, and the search for the impossible |
| topic | Computer (DE-588)4070083-5 gnd Polynomialzeitalgorithmus (DE-588)4199652-5 gnd NP-vollständiges Problem (DE-588)4138229-8 gnd Ungelöstes Problem (DE-588)4186869-9 gnd Komplexitätsklasse NP (DE-588)4500955-7 gnd P-vollständiges Problem (DE-588)4395792-4 gnd Programmanalyse (DE-588)4175841-9 gnd |
| topic_facet | Computer Polynomialzeitalgorithmus NP-vollständiges Problem Ungelöstes Problem Komplexitätsklasse NP P-vollständiges Problem Programmanalyse |
| work_keys_str_mv | AT fortnowlance thegoldenticketpnpandthesearchfortheimpossible |