Feasible computations and provable complexity properties:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Philadelphia, Pa.
Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104)
1978
|
| Schriftenreihe: | CBMS-NSF regional conference series in applied mathematics
30 |
| Schlagworte: | |
| Online-Zugang: | TUM01 UBW01 UBY01 UER01 Volltext |
| Beschreibung: | Mode of access: World Wide Web. - System requirements: Adobe Acrobat Reader Includes bibliographical references (s. 61-62) Reductions and complete sets -- L-isomorphisms of complete sets -- Structure of complete sets -- Long proofs of trivial theorems -- What can and cannot be proven about computational complexity -- Relativized P NP problem An overview of current developments in research on feasible computations; and a consideration of this area of research in relation to provable properties of complexity of computations. The author begins by defining and discussing efficient reductions between problems and considers the families and corresponding complete languages of NL, DCSL, CSL, P, NP, PTAPE, EXPTIME, and EXPTAPE. Definitions and results are uniformly extended to computationally simpler natural families of languages such as NL, P, and CSL by using Log n-tape bounded reductions. The problem of determining what can and cannot be formally proven about running times of algorithms is discussed and related to the problem of establishing sharp time bounds for one-tape Turing machine computations, and the inability to formally prove running times for algorithms is then related to the presence of gaps in the hierarchy of complexity classes. The concluding discussion is on the possibility that the famous P=NP? problem is independent of the axioms of formal mathematical systems such as set theory |
| Beschreibung: | 1 Online-Ressource (vii, 62 Seiten) |
| ISBN: | 0898710278 9780898710274 |
| DOI: | 10.1137/1.9781611970395 |
Internformat
MARC
| LEADER | 00000nmm a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV039747261 | ||
| 003 | DE-604 | ||
| 005 | 20210120 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 111207s1978 sz |||| o||u| ||||||eng d | ||
| 020 | |a 0898710278 |c pbk. |9 0898710278 | ||
| 020 | |a 9780898710274 |c pbk. |9 9780898710274 | ||
| 024 | 7 | |a 10.1137/1.9781611970395 |2 doi | |
| 035 | |a (OCoLC)775728821 | ||
| 035 | |a (DE-599)BVBBV039747261 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 044 | |a sz |c XA-CH | ||
| 049 | |a DE-91 |a DE-29 |a DE-706 |a DE-83 |a DE-20 | ||
| 084 | |a SI 196 |0 (DE-625)143099: |2 rvk | ||
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 100 | 1 | |a Hartmanis, Juris |d 1928-2022 |e Verfasser |0 (DE-588)11892947X |4 aut | |
| 245 | 1 | 0 | |a Feasible computations and provable complexity properties |c Juris Hartmanis |
| 264 | 1 | |a Philadelphia, Pa. |b Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104) |c 1978 | |
| 300 | |a 1 Online-Ressource (vii, 62 Seiten) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a CBMS-NSF regional conference series in applied mathematics |v 30 | |
| 500 | |a Mode of access: World Wide Web. - System requirements: Adobe Acrobat Reader | ||
| 500 | |a Includes bibliographical references (s. 61-62) | ||
| 500 | |a Reductions and complete sets -- L-isomorphisms of complete sets -- Structure of complete sets -- Long proofs of trivial theorems -- What can and cannot be proven about computational complexity -- Relativized P NP problem | ||
| 500 | |a An overview of current developments in research on feasible computations; and a consideration of this area of research in relation to provable properties of complexity of computations. The author begins by defining and discussing efficient reductions between problems and considers the families and corresponding complete languages of NL, DCSL, CSL, P, NP, PTAPE, EXPTIME, and EXPTAPE. Definitions and results are uniformly extended to computationally simpler natural families of languages such as NL, P, and CSL by using Log n-tape bounded reductions. The problem of determining what can and cannot be formally proven about running times of algorithms is discussed and related to the problem of establishing sharp time bounds for one-tape Turing machine computations, and the inability to formally prove running times for algorithms is then related to the presence of gaps in the hierarchy of complexity classes. The concluding discussion is on the possibility that the famous P=NP? problem is independent of the axioms of formal mathematical systems such as set theory | ||
| 650 | 4 | |a Machine theory | |
| 650 | 4 | |a Formal languages | |
| 650 | 4 | |a Computational complexity | |
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 1 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe, Paperback |z 0898710278 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe, Paperback |z 9780898710274 |
| 830 | 0 | |a CBMS-NSF regional conference series in applied mathematics |v 30 |w (DE-604)BV046682627 |9 30 | |
| 856 | 4 | 0 | |u https://doi.org/10.1137/1.9781611970395 |x Verlag |3 Volltext |
| 912 | |a ZDB-72-SIA | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-024594792 | ||
| 966 | e | |u https://doi.org/10.1137/1.9781611970395 |l TUM01 |p ZDB-72-SIA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1137/1.9781611970395 |l UBW01 |p ZDB-72-SIA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1137/1.9781611970395 |l UBY01 |p ZDB-72-SIA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1137/1.9781611970395 |l UER01 |p ZDB-72-SIA |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804148637494673408 |
|---|---|
| any_adam_object | |
| author | Hartmanis, Juris 1928-2022 |
| author_GND | (DE-588)11892947X |
| author_facet | Hartmanis, Juris 1928-2022 |
| author_role | aut |
| author_sort | Hartmanis, Juris 1928-2022 |
| author_variant | j h jh |
| building | Verbundindex |
| bvnumber | BV039747261 |
| classification_rvk | SI 196 ST 130 |
| collection | ZDB-72-SIA |
| ctrlnum | (OCoLC)775728821 (DE-599)BVBBV039747261 |
| discipline | Informatik Mathematik |
| doi_str_mv | 10.1137/1.9781611970395 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03825nmm a2200589 cb4500</leader><controlfield tag="001">BV039747261</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20210120 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">111207s1978 sz |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0898710278</subfield><subfield code="c">pbk.</subfield><subfield code="9">0898710278</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780898710274</subfield><subfield code="c">pbk.</subfield><subfield code="9">9780898710274</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1137/1.9781611970395</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)775728821</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV039747261</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">sz</subfield><subfield code="c">XA-CH</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SI 196</subfield><subfield code="0">(DE-625)143099:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hartmanis, Juris</subfield><subfield code="d">1928-2022</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)11892947X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Feasible computations and provable complexity properties</subfield><subfield code="c">Juris Hartmanis</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Philadelphia, Pa.</subfield><subfield code="b">Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104)</subfield><subfield code="c">1978</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (vii, 62 Seiten)</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">CBMS-NSF regional conference series in applied mathematics</subfield><subfield code="v">30</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Mode of access: World Wide Web. - System requirements: Adobe Acrobat Reader</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (s. 61-62)</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Reductions and complete sets -- L-isomorphisms of complete sets -- Structure of complete sets -- Long proofs of trivial theorems -- What can and cannot be proven about computational complexity -- Relativized P NP problem</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">An overview of current developments in research on feasible computations; and a consideration of this area of research in relation to provable properties of complexity of computations. The author begins by defining and discussing efficient reductions between problems and considers the families and corresponding complete languages of NL, DCSL, CSL, P, NP, PTAPE, EXPTIME, and EXPTAPE. Definitions and results are uniformly extended to computationally simpler natural families of languages such as NL, P, and CSL by using Log n-tape bounded reductions. The problem of determining what can and cannot be formally proven about running times of algorithms is discussed and related to the problem of establishing sharp time bounds for one-tape Turing machine computations, and the inability to formally prove running times for algorithms is then related to the presence of gaps in the hierarchy of complexity classes. The concluding discussion is on the possibility that the famous P=NP? problem is independent of the axioms of formal mathematical systems such as set theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machine theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Formal languages</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</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="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">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe, Paperback</subfield><subfield code="z">0898710278</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe, Paperback</subfield><subfield code="z">9780898710274</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">CBMS-NSF regional conference series in applied mathematics</subfield><subfield code="v">30</subfield><subfield code="w">(DE-604)BV046682627</subfield><subfield code="9">30</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1137/1.9781611970395</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-72-SIA</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-024594792</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1137/1.9781611970395</subfield><subfield code="l">TUM01</subfield><subfield code="p">ZDB-72-SIA</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.1137/1.9781611970395</subfield><subfield code="l">UBW01</subfield><subfield code="p">ZDB-72-SIA</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.1137/1.9781611970395</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-72-SIA</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.1137/1.9781611970395</subfield><subfield code="l">UER01</subfield><subfield code="p">ZDB-72-SIA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV039747261 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T00:10:18Z |
| institution | BVB |
| isbn | 0898710278 9780898710274 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-024594792 |
| oclc_num | 775728821 |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM DE-29 DE-706 DE-83 DE-20 |
| owner_facet | DE-91 DE-BY-TUM DE-29 DE-706 DE-83 DE-20 |
| physical | 1 Online-Ressource (vii, 62 Seiten) |
| psigel | ZDB-72-SIA |
| publishDate | 1978 |
| publishDateSearch | 1978 |
| publishDateSort | 1978 |
| publisher | Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104) |
| record_format | marc |
| series | CBMS-NSF regional conference series in applied mathematics |
| series2 | CBMS-NSF regional conference series in applied mathematics |
| spelling | Hartmanis, Juris 1928-2022 Verfasser (DE-588)11892947X aut Feasible computations and provable complexity properties Juris Hartmanis Philadelphia, Pa. Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104) 1978 1 Online-Ressource (vii, 62 Seiten) txt rdacontent c rdamedia cr rdacarrier CBMS-NSF regional conference series in applied mathematics 30 Mode of access: World Wide Web. - System requirements: Adobe Acrobat Reader Includes bibliographical references (s. 61-62) Reductions and complete sets -- L-isomorphisms of complete sets -- Structure of complete sets -- Long proofs of trivial theorems -- What can and cannot be proven about computational complexity -- Relativized P NP problem An overview of current developments in research on feasible computations; and a consideration of this area of research in relation to provable properties of complexity of computations. The author begins by defining and discussing efficient reductions between problems and considers the families and corresponding complete languages of NL, DCSL, CSL, P, NP, PTAPE, EXPTIME, and EXPTAPE. Definitions and results are uniformly extended to computationally simpler natural families of languages such as NL, P, and CSL by using Log n-tape bounded reductions. The problem of determining what can and cannot be formally proven about running times of algorithms is discussed and related to the problem of establishing sharp time bounds for one-tape Turing machine computations, and the inability to formally prove running times for algorithms is then related to the presence of gaps in the hierarchy of complexity classes. The concluding discussion is on the possibility that the famous P=NP? problem is independent of the axioms of formal mathematical systems such as set theory Machine theory Formal languages Computational complexity Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 s DE-604 Komplexitätstheorie (DE-588)4120591-1 s Erscheint auch als Druck-Ausgabe, Paperback 0898710278 Erscheint auch als Druck-Ausgabe, Paperback 9780898710274 CBMS-NSF regional conference series in applied mathematics 30 (DE-604)BV046682627 30 https://doi.org/10.1137/1.9781611970395 Verlag Volltext |
| spellingShingle | Hartmanis, Juris 1928-2022 Feasible computations and provable complexity properties CBMS-NSF regional conference series in applied mathematics Machine theory Formal languages Computational complexity Komplexitätstheorie (DE-588)4120591-1 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| subject_GND | (DE-588)4120591-1 (DE-588)4134751-1 |
| title | Feasible computations and provable complexity properties |
| title_auth | Feasible computations and provable complexity properties |
| title_exact_search | Feasible computations and provable complexity properties |
| title_full | Feasible computations and provable complexity properties Juris Hartmanis |
| title_fullStr | Feasible computations and provable complexity properties Juris Hartmanis |
| title_full_unstemmed | Feasible computations and provable complexity properties Juris Hartmanis |
| title_short | Feasible computations and provable complexity properties |
| title_sort | feasible computations and provable complexity properties |
| topic | Machine theory Formal languages Computational complexity Komplexitätstheorie (DE-588)4120591-1 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| topic_facet | Machine theory Formal languages Computational complexity Komplexitätstheorie Berechnungskomplexität |
| url | https://doi.org/10.1137/1.9781611970395 |
| volume_link | (DE-604)BV046682627 |
| work_keys_str_mv | AT hartmanisjuris feasiblecomputationsandprovablecomplexityproperties |