Completeness and reduction in algebraic complexity theory:
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Hochschulschrift/Dissertation Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2000
|
| Schriftenreihe: | Algorithms and computation in mathematics
7 |
| Schlagwörter: | |
| Links: | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008910420&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| Umfang: | XII, 168 S. graph. Darst. |
| ISBN: | 3540667520 |
Internformat
MARC
| LEADER | 00000nam a22000008cb4500 | ||
|---|---|---|---|
| 001 | BV013078626 | ||
| 003 | DE-604 | ||
| 005 | 20131128 | ||
| 007 | t| | ||
| 008 | 000314s2000 gw d||| m||| 00||| eng d | ||
| 016 | 7 | |a 958545197 |2 DE-101 | |
| 020 | |a 3540667520 |9 3-540-66752-0 | ||
| 035 | |a (OCoLC)43648697 | ||
| 035 | |a (DE-599)BVBBV013078626 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-739 |a DE-20 |a DE-355 |a DE-703 |a DE-824 |a DE-29T |a DE-91G |a DE-706 |a DE-634 |a DE-11 |a DE-188 |a DE-83 | ||
| 050 | 0 | |a QA267.7 | |
| 082 | 0 | |a 511.3 |2 21 | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a DAT 517f |2 stub | ||
| 084 | |a 68Q15 |2 msc | ||
| 084 | |a 22E70 |2 msc | ||
| 084 | |a 15A15 |2 msc | ||
| 100 | 1 | |a Bürgisser, Peter |d 1962- |e Verfasser |0 (DE-588)1041607911 |4 aut | |
| 245 | 1 | 0 | |a Completeness and reduction in algebraic complexity theory |c Peter Bürgisser |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2000 | |
| 300 | |a XII, 168 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Algorithms and computation in mathematics |v 7 | |
| 502 | |a Zugl.: Zürich, Univ., Habil.-Schr. | ||
| 650 | 7 | |a Computabilidade e complexidade |2 larpcal | |
| 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 |
| 650 | 0 | 7 | |a Algebra |0 (DE-588)4001156-2 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Algebra |0 (DE-588)4001156-2 |D s |
| 689 | 0 | 1 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 1 | |5 DE-604 | |
| 830 | 0 | |a Algorithms and computation in mathematics |v 7 |w (DE-604)BV011131286 |9 7 | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008910420&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-008910420 | |
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0102 DAT 517f 2005 A 5427 |
|---|---|
| DE-BY-TUM_katkey | 1512099 |
| DE-BY-TUM_location | 01 |
| DE-BY-TUM_media_number | 040020054208 |
| _version_ | 1821931616895762432 |
| adam_text | Contents
1 Introduction 1
1.1 Classical Model 1
1.2 Blum Shub Smale Model 3
1.3 Valiant s Model 4
1.4 Overview of Main Results 6
2 Valiant s Algebraic Model of NP Completeness 11
2.1 The Complexity Classes VP and VNP 11
2.2 Completeness of the Permanent Family 16
2.2.1 p Definability and Formula Size 16
2.2.2 Universality of the Permanent 19
2.2.3 Completeness of the Permanent 21
2.3 Closure Properties 25
2.4 Parallel Complexity 30
2.5 Completeness of the Determinant Family 34
3 Some Complete Families of Polynomials 37
3.1 Generating Functions of Graph Properties 37
3.2 p Computable Families 39
3.3 VNP Complete Families 41
3.3.1 Matchings 42
3.3.2 Cliques 43
3.3.3 Cycle Format Polynomials 44
3.3.4 Graph Factors 48
3.3.5 Hamilton Cycles of Planar Graphs 50
3.3.6 Self Avoiding Walks 53
3.3.7 Connectivity 55
4 Cook s versus Valiant s Hypothesis 61
4.1 Dependence on the Field 61
4.2 Statement of Main Results 64
4.3 Review of Discrete Complexity Classes 66
4.4 Relating NP to Counting Classes 68
4.5 A Bound on the Heights 70
4.6 Roots of Univariate Polynomials Modulo a Prime 75
4.7 Proof of Thm. 4.5 76
XII Contents
5 The Structure of Valiant s Complexity Classes 81
5.1 Outline and Comparison with Previous Work 81
5.2 An Abstract Diagonalization Theorem 82
5.3 An Abstract Embedding Theorem 85
5.4 Structure of Valiant s Complexity Classes 89
5.5 A Specific Family Neither Complete Nor p Computable .... 92
5.6 Relativized Complexity Classes 96
6 Fast Evaluation of Representations
of General Linear Groups 105
6.1 Description of the Problem 105
6.2 Preliminaries on Representations of GLTO 107
6.3 Auxiliary Fast Linear Algebra Algorithms 109
6.4 An Algorithm for Evaluating Representations 112
6.5 A Lower Bound 114
6.6 Fast Evaluation of Legendre Functions 115
7 The Complexity of Immanants 117
7.1 Motivation and Outline of Chapter 117
7.2 Fast Evaluation of Immanants 118
7.3 Completeness Results for Immanants 120
7.4 Character Formulas for the Symmetric Group 121
7.5 p Definability of Immanants 126
7.6 Completeness Proofs 128
8 Separation Results and Future Directions 135
8.1 Specific Families Which Are Not p Definable 135
8.2 Separations for the Complexity Class VQP 139
8.3 Possible Connections to Univariate Polynomials 141
8.4 Connections to the BSS Model 143
References 149
List of Notation 159
Index 163
|
| any_adam_object | 1 |
| author | Bürgisser, Peter 1962- |
| author_GND | (DE-588)1041607911 |
| author_facet | Bürgisser, Peter 1962- |
| author_role | aut |
| author_sort | Bürgisser, Peter 1962- |
| author_variant | p b pb |
| building | Verbundindex |
| bvnumber | BV013078626 |
| callnumber-first | Q - Science |
| callnumber-label | QA267 |
| callnumber-raw | QA267.7 |
| callnumber-search | QA267.7 |
| callnumber-sort | QA 3267.7 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 890 ST 130 ST 134 |
| classification_tum | DAT 517f |
| ctrlnum | (OCoLC)43648697 (DE-599)BVBBV013078626 |
| dewey-full | 511.3 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3 |
| dewey-search | 511.3 |
| dewey-sort | 3511.3 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02220nam a22005658cb4500</leader><controlfield tag="001">BV013078626</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20131128 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">000314s2000 gw d||| m||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">958545197</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540667520</subfield><subfield code="9">3-540-66752-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)43648697</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV013078626</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-739</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA267.7</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</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="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 517f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68Q15</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">22E70</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">15A15</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bürgisser, Peter</subfield><subfield code="d">1962-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1041607911</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Completeness and reduction in algebraic complexity theory</subfield><subfield code="c">Peter Bürgisser</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2000</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XII, 168 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">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="1" ind2=" "><subfield code="a">Algorithms and computation in mathematics</subfield><subfield code="v">7</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Zugl.: Zürich, Univ., Habil.-Schr.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computabilidade e complexidade</subfield><subfield code="2">larpcal</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="650" ind1="0" ind2="7"><subfield code="a">Algebra</subfield><subfield code="0">(DE-588)4001156-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algebra</subfield><subfield code="0">(DE-588)4001156-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-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">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Algorithms and computation in mathematics</subfield><subfield code="v">7</subfield><subfield code="w">(DE-604)BV011131286</subfield><subfield code="9">7</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008910420&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-008910420</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV013078626 |
| illustrated | Illustrated |
| indexdate | 2024-12-20T10:40:59Z |
| institution | BVB |
| isbn | 3540667520 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-008910420 |
| oclc_num | 43648697 |
| open_access_boolean | |
| owner | DE-739 DE-20 DE-355 DE-BY-UBR DE-703 DE-824 DE-29T DE-91G DE-BY-TUM DE-706 DE-634 DE-11 DE-188 DE-83 |
| owner_facet | DE-739 DE-20 DE-355 DE-BY-UBR DE-703 DE-824 DE-29T DE-91G DE-BY-TUM DE-706 DE-634 DE-11 DE-188 DE-83 |
| physical | XII, 168 S. graph. Darst. |
| publishDate | 2000 |
| publishDateSearch | 2000 |
| publishDateSort | 2000 |
| publisher | Springer |
| record_format | marc |
| series | Algorithms and computation in mathematics |
| series2 | Algorithms and computation in mathematics |
| spellingShingle | Bürgisser, Peter 1962- Completeness and reduction in algebraic complexity theory Algorithms and computation in mathematics Computabilidade e complexidade larpcal Computational complexity Komplexitätstheorie (DE-588)4120591-1 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Algebra (DE-588)4001156-2 gnd |
| subject_GND | (DE-588)4120591-1 (DE-588)4134751-1 (DE-588)4001156-2 (DE-588)4113937-9 |
| title | Completeness and reduction in algebraic complexity theory |
| title_auth | Completeness and reduction in algebraic complexity theory |
| title_exact_search | Completeness and reduction in algebraic complexity theory |
| title_full | Completeness and reduction in algebraic complexity theory Peter Bürgisser |
| title_fullStr | Completeness and reduction in algebraic complexity theory Peter Bürgisser |
| title_full_unstemmed | Completeness and reduction in algebraic complexity theory Peter Bürgisser |
| title_short | Completeness and reduction in algebraic complexity theory |
| title_sort | completeness and reduction in algebraic complexity theory |
| topic | Computabilidade e complexidade larpcal Computational complexity Komplexitätstheorie (DE-588)4120591-1 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Algebra (DE-588)4001156-2 gnd |
| topic_facet | Computabilidade e complexidade Computational complexity Komplexitätstheorie Berechnungskomplexität Algebra Hochschulschrift |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008910420&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV011131286 |
| work_keys_str_mv | AT burgisserpeter completenessandreductioninalgebraiccomplexitytheory |
Inhaltsverzeichnis
Paper/Kapitel scannen lassen
Paper/Kapitel scannen lassen
Teilbibliothek Mathematik & Informatik
| Signatur: |
0102 DAT 517f 2005 A 5427
Lageplan |
|---|---|
| Exemplar 1 | Ausleihbar Am Standort |