Geometry and complexity theory:
Two central problems in computer science are P vs NP and the complexity of matrix multiplication. The first is also a leading candidate for the greatest unsolved problem in mathematics. The second is of enormous practical and theoretical importance. Algebraic geometry and representation theory provi...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2017
|
| Schriftenreihe: | Cambridge studies in advanced mathematics
169 |
| Schlagworte: | |
| Online-Zugang: | BSB01 FHN01 UBR01 URL des Erstveröffentlichers |
| Zusammenfassung: | Two central problems in computer science are P vs NP and the complexity of matrix multiplication. The first is also a leading candidate for the greatest unsolved problem in mathematics. The second is of enormous practical and theoretical importance. Algebraic geometry and representation theory provide fertile ground for advancing work on these problems and others in complexity. This introduction to algebraic complexity theory for graduate students and researchers in computer science and mathematics features concrete examples that demonstrate the application of geometric techniques to real world problems. Written by a noted expert in the field, it offers numerous open questions to motivate future research. Complexity theory has rejuvenated classical geometric questions and brought different areas of mathematics together in new ways. This book will show the beautiful, interesting, and important questions that have arisen as a result |
| Beschreibung: | Title from publisher's bibliographic system (viewed on 24 Oct 2017) |
| Beschreibung: | 1 online resource (xi, 339 Seiten) |
| ISBN: | 9781108183192 |
| DOI: | 10.1017/9781108183192 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV044727855 | ||
| 003 | DE-604 | ||
| 005 | 20190221 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 180124s2017 |||| o||u| ||||||eng d | ||
| 020 | |a 9781108183192 |c Online |9 978-1-108-18319-2 | ||
| 024 | 7 | |a 10.1017/9781108183192 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9781108183192 | ||
| 035 | |a (OCoLC)1016159639 | ||
| 035 | |a (DE-599)BVBBV044727855 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-92 |a DE-12 |a DE-355 | ||
| 082 | 0 | |a 516.3/5 |2 23 | |
| 084 | |a SK 240 |0 (DE-625)143226: |2 rvk | ||
| 100 | 1 | |a Landsberg, Joseph M. |d 1963- |e Verfasser |0 (DE-588)14180677X |4 aut | |
| 245 | 1 | 0 | |a Geometry and complexity theory |c J.M. Landsberg, Texas A&M University |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2017 | |
| 300 | |a 1 online resource (xi, 339 Seiten) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Cambridge studies in advanced mathematics |v 169 | |
| 500 | |a Title from publisher's bibliographic system (viewed on 24 Oct 2017) | ||
| 520 | |a Two central problems in computer science are P vs NP and the complexity of matrix multiplication. The first is also a leading candidate for the greatest unsolved problem in mathematics. The second is of enormous practical and theoretical importance. Algebraic geometry and representation theory provide fertile ground for advancing work on these problems and others in complexity. This introduction to algebraic complexity theory for graduate students and researchers in computer science and mathematics features concrete examples that demonstrate the application of geometric techniques to real world problems. Written by a noted expert in the field, it offers numerous open questions to motivate future research. Complexity theory has rejuvenated classical geometric questions and brought different areas of mathematics together in new ways. This book will show the beautiful, interesting, and important questions that have arisen as a result | ||
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Geometry, Algebraic | |
| 650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algebraische Geometrie |0 (DE-588)4001161-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 0 | 1 | |a Algebraische Geometrie |0 (DE-588)4001161-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781107199231 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/9781108183192 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-030123979 | ||
| 966 | e | |u https://doi.org/10.1017/9781108183192 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/9781108183192 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/9781108183192 |l UBR01 |p ZDB-20-CBO |q UBR Einzelkauf (Lückenergänzung CUP Serien 2018) |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804178221121404928 |
|---|---|
| any_adam_object | |
| author | Landsberg, Joseph M. 1963- |
| author_GND | (DE-588)14180677X |
| author_facet | Landsberg, Joseph M. 1963- |
| author_role | aut |
| author_sort | Landsberg, Joseph M. 1963- |
| author_variant | j m l jm jml |
| building | Verbundindex |
| bvnumber | BV044727855 |
| classification_rvk | SK 240 |
| collection | ZDB-20-CBO |
| ctrlnum | (ZDB-20-CBO)CR9781108183192 (OCoLC)1016159639 (DE-599)BVBBV044727855 |
| dewey-full | 516.3/5 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 516 - Geometry |
| dewey-raw | 516.3/5 |
| dewey-search | 516.3/5 |
| dewey-sort | 3516.3 15 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.1017/9781108183192 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03001nmm a2200493zcb4500</leader><controlfield tag="001">BV044727855</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20190221 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">180124s2017 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781108183192</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-108-18319-2</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/9781108183192</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9781108183192</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1016159639</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV044727855</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="049" ind1=" " ind2=" "><subfield code="a">DE-92</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-355</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">516.3/5</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 240</subfield><subfield code="0">(DE-625)143226:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Landsberg, Joseph M.</subfield><subfield code="d">1963-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)14180677X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Geometry and complexity theory</subfield><subfield code="c">J.M. Landsberg, Texas A&M University</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2017</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xi, 339 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="0" ind2=" "><subfield code="a">Cambridge studies in advanced mathematics</subfield><subfield code="v">169</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 24 Oct 2017)</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Two central problems in computer science are P vs NP and the complexity of matrix multiplication. The first is also a leading candidate for the greatest unsolved problem in mathematics. The second is of enormous practical and theoretical importance. Algebraic geometry and representation theory provide fertile ground for advancing work on these problems and others in complexity. This introduction to algebraic complexity theory for graduate students and researchers in computer science and mathematics features concrete examples that demonstrate the application of geometric techniques to real world problems. Written by a noted expert in the field, it offers numerous open questions to motivate future research. Complexity theory has rejuvenated classical geometric questions and brought different areas of mathematics together in new ways. This book will show the beautiful, interesting, and important questions that have arisen as a result</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Geometry, Algebraic</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">Algebraische Geometrie</subfield><subfield code="0">(DE-588)4001161-6</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="1"><subfield code="a">Algebraische Geometrie</subfield><subfield code="0">(DE-588)4001161-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" 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</subfield><subfield code="z">9781107199231</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/9781108183192</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030123979</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/9781108183192</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</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.1017/9781108183192</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</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.1017/9781108183192</subfield><subfield code="l">UBR01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">UBR Einzelkauf (Lückenergänzung CUP Serien 2018)</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV044727855 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T08:00:31Z |
| institution | BVB |
| isbn | 9781108183192 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030123979 |
| oclc_num | 1016159639 |
| open_access_boolean | |
| owner | DE-92 DE-12 DE-355 DE-BY-UBR |
| owner_facet | DE-92 DE-12 DE-355 DE-BY-UBR |
| physical | 1 online resource (xi, 339 Seiten) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO ZDB-20-CBO UBR Einzelkauf (Lückenergänzung CUP Serien 2018) |
| publishDate | 2017 |
| publishDateSearch | 2017 |
| publishDateSort | 2017 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | Cambridge studies in advanced mathematics |
| spelling | Landsberg, Joseph M. 1963- Verfasser (DE-588)14180677X aut Geometry and complexity theory J.M. Landsberg, Texas A&M University Cambridge Cambridge University Press 2017 1 online resource (xi, 339 Seiten) txt rdacontent c rdamedia cr rdacarrier Cambridge studies in advanced mathematics 169 Title from publisher's bibliographic system (viewed on 24 Oct 2017) Two central problems in computer science are P vs NP and the complexity of matrix multiplication. The first is also a leading candidate for the greatest unsolved problem in mathematics. The second is of enormous practical and theoretical importance. Algebraic geometry and representation theory provide fertile ground for advancing work on these problems and others in complexity. This introduction to algebraic complexity theory for graduate students and researchers in computer science and mathematics features concrete examples that demonstrate the application of geometric techniques to real world problems. Written by a noted expert in the field, it offers numerous open questions to motivate future research. Complexity theory has rejuvenated classical geometric questions and brought different areas of mathematics together in new ways. This book will show the beautiful, interesting, and important questions that have arisen as a result Computational complexity Geometry, Algebraic Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Algebraische Geometrie (DE-588)4001161-6 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 s Algebraische Geometrie (DE-588)4001161-6 s DE-604 Erscheint auch als Druck-Ausgabe 9781107199231 https://doi.org/10.1017/9781108183192 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Landsberg, Joseph M. 1963- Geometry and complexity theory Computational complexity Geometry, Algebraic Berechnungskomplexität (DE-588)4134751-1 gnd Algebraische Geometrie (DE-588)4001161-6 gnd |
| subject_GND | (DE-588)4134751-1 (DE-588)4001161-6 |
| title | Geometry and complexity theory |
| title_auth | Geometry and complexity theory |
| title_exact_search | Geometry and complexity theory |
| title_full | Geometry and complexity theory J.M. Landsberg, Texas A&M University |
| title_fullStr | Geometry and complexity theory J.M. Landsberg, Texas A&M University |
| title_full_unstemmed | Geometry and complexity theory J.M. Landsberg, Texas A&M University |
| title_short | Geometry and complexity theory |
| title_sort | geometry and complexity theory |
| topic | Computational complexity Geometry, Algebraic Berechnungskomplexität (DE-588)4134751-1 gnd Algebraische Geometrie (DE-588)4001161-6 gnd |
| topic_facet | Computational complexity Geometry, Algebraic Berechnungskomplexität Algebraische Geometrie |
| url | https://doi.org/10.1017/9781108183192 |
| work_keys_str_mv | AT landsbergjosephm geometryandcomplexitytheory |