Parameterized complexity theory:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2006
|
| Schriftenreihe: | Texts in theoretical computer science
|
| Schlagworte: | |
| Online-Zugang: | Inhaltstext Inhaltsverzeichnis |
| Beschreibung: | Literaturverz. S. [463] - 475 |
| Beschreibung: | XIII, 493 Seiten Illustrationen, Diagramme |
| ISBN: | 9783540299523 3540299521 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV021575825 | ||
| 003 | DE-604 | ||
| 005 | 20241104 | ||
| 007 | t | ||
| 008 | 060510s2006 gw a||| |||| 00||| eng d | ||
| 015 | |a 06,N09,0019 |2 dnb | ||
| 015 | |a 06,A13,0929 |2 dnb | ||
| 016 | 7 | |a 978257308 |2 DE-101 | |
| 020 | |a 9783540299523 |c Pp. : EUR 74.85 (freier Pr.), sfr 123.50 (freier Pr.) |9 978-3-540-29952-3 | ||
| 020 | |a 3540299521 |c Pp. : EUR 74.85 (freier Pr.), sfr 123.50 (freier Pr.) |9 3-540-29952-1 | ||
| 024 | 3 | |a 9783540299523 | |
| 028 | 5 | 2 | |a 11573166 |
| 035 | |a (OCoLC)181539305 | ||
| 035 | |a (DE-599)BVBBV021575825 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE-BE | ||
| 049 | |a DE-703 |a DE-19 |a DE-20 |a DE-11 |a DE-384 |a DE-83 |a DE-634 |a DE-739 | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a 004 |2 sdnb | ||
| 084 | |a 510 |2 sdnb | ||
| 100 | 1 | |a Flum, Jörg |d 1944- |e Verfasser |0 (DE-588)121343391 |4 aut | |
| 245 | 1 | 0 | |a Parameterized complexity theory |c J. Flum ; M. Grohe |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2006 | |
| 300 | |a XIII, 493 Seiten |b Illustrationen, Diagramme | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Texts in theoretical computer science | |
| 500 | |a Literaturverz. S. [463] - 475 | ||
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Computational complexity | |
| 650 | 0 | 7 | |a Parametrisierte Komplexität |0 (DE-588)4818897-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Parametrisierte Komplexität |0 (DE-588)4818897-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Grohe, Martin |d 1967- |e Verfasser |0 (DE-588)1019542179 |4 aut | |
| 856 | 4 | 2 | |q text/html |u http://deposit.dnb.de/cgi-bin/dokserv?id=2768760&prov=M&dok_var=1&dok_ext=htm |3 Inhaltstext |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=014791571&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-014791571 | |
Datensatz im Suchindex
| _version_ | 1814812060678094848 |
|---|---|
| adam_text |
J. FLUM YY M. GROHE
PARAMETERIZED
COMPLEXITY THEORY
WITH 51 FIGURES
4Y SPRINGER
CONTENTS
1 FIXED-PARAMETE
R TRACTABILIT
Y
1
1.1 INTRODUCTION 1
1.2 PARAMETERIZED PROBLEMS AND FIXED-PARAMETER TRACTABILITY .
. 3
1.3 HITTING SETS AND TH
E METHOD OF BOUNDED SEARCH TREES 10
1.4 APPROXIMABILITY AND FIXED-PARAMETER TRACTABILITY 19
1.5 MODEL-CHECKING PROBLEMS 24
1.6 ALTERNATIVE CHARACTERIZATIONS OF FIXED-PARAMETER TRACTABILITY. . 26
2 REDUCTION
S AN
D PARAMETERIZE
D INTRACTABILIT
Y
33
2.1 FIXED-PARAMETER TRACTABLE REDUCTIONS 33
2.2 THE CLASS PARA-NP 37
2.3 THE CLASS XP 41
3
TH
E CLAS
S
W[P
] 45
3.1 DEFINITION AND BASIC RESULTS 45
3.2 W[P]-COMPLETE PROBLEMS 49
3.3 IS FP
T 7^ W[P]? 57
4 LOGIC AN
D COMPLEXIT
Y
65
4.1 PROPOSITIONAL LOGIC 66
4.2 FIRST-ORDER AND SECOND-ORDER LOGIC 72
4.3 THE COMPLEXITY OF FIRST-ORDER AND SECOND-ORDER LOGIC 81
4.4 OPTIMIZATION PROBLEMS AND LIMITED NONDETERMINISM 88
5 TW
O FUNDAMENTA
L HIERARCHIE
S
95
5.1
THE W-HIERARCHY 95
5.2 THE A-HIERARCHY 98
6 TH
E FIRS
T LEVEL OF TH
E HIERARCHIE
S
105
6.1
A[L]-COMPLETE PROBLEMS 106
6.2 A[L] AND MACHINES 114
XII CONTENTS
6.3 A[L] AND PROPOSITIONAL LOGIC 123
6.4 A[L] = W[L] 128
7 TH
E W-HIERARCHY
133
7.1 THE W-HIERARCHY AND PROPOSITIONAL LOGIC 133
7.2 W[2]-COMPLETE PROBLEMS 143
7.3 THE W-HIERARCHY AND CIRCUITS 147
7.4 THE W-HIERARCHY AND FIRST-ORDER LOGIC 148
7.5 W[2] AND TURING MACHINES 153
7.6 THE MONOTONE AND ANTIMONOTONE COLLAPSE 156
7.7 THE CLASS W[SAT] 162
8
TH
E A-HIERARCHY
165
8.1 THE A-HIERARCHY AND MACHINES 165
8.2 ^-NORMALIZATIO
N 171
8.3 THE A-HIERARCHY AND PROPOSITIONAL LOGIC 174
8.4 COMPLETE PROBLEMS FOR A[2] AND CO-A[L] 180
8.5 THE A-HIERARCHY AND FAGIN DEFINABILITY 186
8.6 THE CLASSES AW[*] AND AW[P] 188
8.7 THE A-MATRIX 195
8.8 BACK TO THE W-HIERARCHY 197
9 KERNELIZATIO
N AND LINEAR PROGRAMMIN
G TECHNIQUES
207
9.1 POLYNOMIAL KERNELIZATIONS 208
9.2 CROWN RULE REDUCTIONS 212
9.3 KERNELIZATION THROUGH LINEAR PROGRAMMING 218
9.4 INTEGER LINEAR PROGRAMMING 222
10 TH
E AUTOMATA-THEORETI
C APPROACH
233
10.1 MODEL-CHECKING ON STRINGS 234
10.2 MODEL-CHECKING ON TREES 245
10.3 LOWER BOUNDS 249
11 TREE WIDT
H
261
11.1 TREE DECOMPOSITIONS OF GRAPHS 262
11.2 COMPUTING TREE DECOMPOSITIONS 266
11.3 TREE DECOMPOSITIONS OF ARBITRARY STRUCTURES 275
11.4 ALGORITHMS ON STRUCTURES OF BOUNDED TREE WIDTH 278
11.5 APPLICATIONS OF COURCELLE'S THEOREM 286
11.6 TREE WIDTH REDUCTION 292
11.7 GRAPH MINORS 295
CONTENTS XIII
12 PLANARIT
Y AND BOUNDE
D LOCAL TREE WIDT
H
301
12.1 ALGORITHMS ON PLANAR GRAPHS 302
12.2 LOCAL TREE WIDTH 313
12.3 MINOR CLOSED CLASSES 320
12.4 IMPROVED PLANAR GRAPH ALGORITHMS 321
13
HOMOMORPHISM
S AND EMBEDDING
S
327
13.1 TRACTABLE RESTRICTIONS OF THE HOMOMORPHISM PROBLEM 327
13.2 THE COMPLEXITY OF THE HOMOMORPHISM PROBLEM 336
13.3 COLOR CODING AND THE EMBEDDING PROBLEM 342
14 PARAMETERIZE
D COUNTIN
G PROBLEM
S
357
14.1 FIXED-PARAMETER TRACTABLE COUNTING PROBLEMS 357
14.2 INTRACTABLE PARAMETERIZED COUNTING PROBLEMS 361
14.3 #W[1]-COMPLETE PROBLEMS 367
14.4 THE COMPLEXITY OF COUNTING PATHS AND CYCLES 372
14.5 APPROXIMATE COUNTING 384
15 BOUNDE
D FIXED-PARAMETE
R TRACTABILITY
389
15.1 THE BOUNDED FRAMEWORK 390
15.2 THE CLASS EW[P] AND LIMITED NONDETERMINISM 394
15.3 THE EW-HIERARCHY 397
15.4 COMPLETE PROBLEMS 402
15.5 THE EW-HIERARCHY AND THE LOG-HIERARCHY 407
15.6 HIGHER LEVELS OF INTRACTABILITY 412
16 SUBEXPONENTIA
L FIXED-PARAMETE
R TRACTABILITY
417
16.1 SIZE-MEASURES AND REDUCTIONS 418
16.2 A HIERARCHY WITHIN EP
T 422
16.3 THE SPARSIFICATION LEMMA 426
16.4 S[1]-COMPLETENESS 435
16.5 THE MINIATURIZATION ISOMORPHISM 438
16.6 THE M-HIERARCHY 443
A APPENDIX
: BACKGROUND FROM COMPLEXIT
Y THEOR
Y
453
A.I MACHINE MODELS 454
A.2 COMPLEXITY CLASSES 460
REFERENCES
463
NOTATIO
N
477
INDE
X 481 |
| adam_txt |
J. FLUM YY M. GROHE
PARAMETERIZED
COMPLEXITY THEORY
WITH 51 FIGURES
4Y SPRINGER
CONTENTS
1 FIXED-PARAMETE
R TRACTABILIT
Y
1
1.1 INTRODUCTION 1
1.2 PARAMETERIZED PROBLEMS AND FIXED-PARAMETER TRACTABILITY .
. 3
1.3 HITTING SETS AND TH
E METHOD OF BOUNDED SEARCH TREES 10
1.4 APPROXIMABILITY AND FIXED-PARAMETER TRACTABILITY 19
1.5 MODEL-CHECKING PROBLEMS 24
1.6 ALTERNATIVE CHARACTERIZATIONS OF FIXED-PARAMETER TRACTABILITY. . 26
2 REDUCTION
S AN
D PARAMETERIZE
D INTRACTABILIT
Y
33
2.1 FIXED-PARAMETER TRACTABLE REDUCTIONS 33
2.2 THE CLASS PARA-NP 37
2.3 THE CLASS XP 41
3
TH
E CLAS
S
W[P
] 45
3.1 DEFINITION AND BASIC RESULTS 45
3.2 W[P]-COMPLETE PROBLEMS 49
3.3 IS FP
T 7^ W[P]? 57
4 LOGIC AN
D COMPLEXIT
Y
65
4.1 PROPOSITIONAL LOGIC 66
4.2 FIRST-ORDER AND SECOND-ORDER LOGIC 72
4.3 THE COMPLEXITY OF FIRST-ORDER AND SECOND-ORDER LOGIC 81
4.4 OPTIMIZATION PROBLEMS AND LIMITED NONDETERMINISM 88
5 TW
O FUNDAMENTA
L HIERARCHIE
S
95
5.1
THE W-HIERARCHY 95
5.2 THE A-HIERARCHY 98
6 TH
E FIRS
T LEVEL OF TH
E HIERARCHIE
S
105
6.1
A[L]-COMPLETE PROBLEMS 106
6.2 A[L] AND MACHINES 114
XII CONTENTS
6.3 A[L] AND PROPOSITIONAL LOGIC 123
6.4 A[L] = W[L] 128
7 TH
E W-HIERARCHY
133
7.1 THE W-HIERARCHY AND PROPOSITIONAL LOGIC 133
7.2 W[2]-COMPLETE PROBLEMS 143
7.3 THE W-HIERARCHY AND CIRCUITS 147
7.4 THE W-HIERARCHY AND FIRST-ORDER LOGIC 148
7.5 W[2] AND TURING MACHINES 153
7.6 THE MONOTONE AND ANTIMONOTONE COLLAPSE 156
7.7 THE CLASS W[SAT] 162
8
TH
E A-HIERARCHY
165
8.1 THE A-HIERARCHY AND MACHINES 165
8.2 ^-NORMALIZATIO
N 171
8.3 THE A-HIERARCHY AND PROPOSITIONAL LOGIC 174
8.4 COMPLETE PROBLEMS FOR A[2] AND CO-A[L] 180
8.5 THE A-HIERARCHY AND FAGIN DEFINABILITY 186
8.6 THE CLASSES AW[*] AND AW[P] 188
8.7 THE A-MATRIX 195
8.8 BACK TO THE W-HIERARCHY 197
9 KERNELIZATIO
N AND LINEAR PROGRAMMIN
G TECHNIQUES
207
9.1 POLYNOMIAL KERNELIZATIONS 208
9.2 CROWN RULE REDUCTIONS 212
9.3 KERNELIZATION THROUGH LINEAR PROGRAMMING 218
9.4 INTEGER LINEAR PROGRAMMING 222
10 TH
E AUTOMATA-THEORETI
C APPROACH
233
10.1 MODEL-CHECKING ON STRINGS 234
10.2 MODEL-CHECKING ON TREES 245
10.3 LOWER BOUNDS 249
11 TREE WIDT
H
261
11.1 TREE DECOMPOSITIONS OF GRAPHS 262
11.2 COMPUTING TREE DECOMPOSITIONS 266
11.3 TREE DECOMPOSITIONS OF ARBITRARY STRUCTURES 275
11.4 ALGORITHMS ON STRUCTURES OF BOUNDED TREE WIDTH 278
11.5 APPLICATIONS OF COURCELLE'S THEOREM 286
11.6 TREE WIDTH REDUCTION 292
11.7 GRAPH MINORS 295
CONTENTS XIII
12 PLANARIT
Y AND BOUNDE
D LOCAL TREE WIDT
H
301
12.1 ALGORITHMS ON PLANAR GRAPHS 302
12.2 LOCAL TREE WIDTH 313
12.3 MINOR CLOSED CLASSES 320
12.4 IMPROVED PLANAR GRAPH ALGORITHMS 321
13
HOMOMORPHISM
S AND EMBEDDING
S
327
13.1 TRACTABLE RESTRICTIONS OF THE HOMOMORPHISM PROBLEM 327
13.2 THE COMPLEXITY OF THE HOMOMORPHISM PROBLEM 336
13.3 COLOR CODING AND THE EMBEDDING PROBLEM 342
14 PARAMETERIZE
D COUNTIN
G PROBLEM
S
357
14.1 FIXED-PARAMETER TRACTABLE COUNTING PROBLEMS 357
14.2 INTRACTABLE PARAMETERIZED COUNTING PROBLEMS 361
14.3 #W[1]-COMPLETE PROBLEMS 367
14.4 THE COMPLEXITY OF COUNTING PATHS AND CYCLES 372
14.5 APPROXIMATE COUNTING 384
15 BOUNDE
D FIXED-PARAMETE
R TRACTABILITY
389
15.1 THE BOUNDED FRAMEWORK 390
15.2 THE CLASS EW[P] AND LIMITED NONDETERMINISM 394
15.3 THE EW-HIERARCHY 397
15.4 COMPLETE PROBLEMS 402
15.5 THE EW-HIERARCHY AND THE LOG-HIERARCHY 407
15.6 HIGHER LEVELS OF INTRACTABILITY 412
16 SUBEXPONENTIA
L FIXED-PARAMETE
R TRACTABILITY
417
16.1 SIZE-MEASURES AND REDUCTIONS 418
16.2 A HIERARCHY WITHIN EP
T 422
16.3 THE SPARSIFICATION LEMMA 426
16.4 S[1]-COMPLETENESS 435
16.5 THE MINIATURIZATION ISOMORPHISM 438
16.6 THE M-HIERARCHY 443
A APPENDIX
: BACKGROUND FROM COMPLEXIT
Y THEOR
Y
453
A.I MACHINE MODELS 454
A.2 COMPLEXITY CLASSES 460
REFERENCES
463
NOTATIO
N
477
INDE
X 481 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Flum, Jörg 1944- Grohe, Martin 1967- |
| author_GND | (DE-588)121343391 (DE-588)1019542179 |
| author_facet | Flum, Jörg 1944- Grohe, Martin 1967- |
| author_role | aut aut |
| author_sort | Flum, Jörg 1944- |
| author_variant | j f jf m g mg |
| building | Verbundindex |
| bvnumber | BV021575825 |
| classification_rvk | ST 134 |
| ctrlnum | (OCoLC)181539305 (DE-599)BVBBV021575825 |
| discipline | Informatik Mathematik |
| discipline_str_mv | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV021575825</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20241104</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">060510s2006 gw a||| |||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">06,N09,0019</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">06,A13,0929</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">978257308</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783540299523</subfield><subfield code="c">Pp. : EUR 74.85 (freier Pr.), sfr 123.50 (freier Pr.)</subfield><subfield code="9">978-3-540-29952-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540299521</subfield><subfield code="c">Pp. : EUR 74.85 (freier Pr.), sfr 123.50 (freier Pr.)</subfield><subfield code="9">3-540-29952-1</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783540299523</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">11573166</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)181539305</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021575825</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">XA-DE-BE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-739</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">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">510</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Flum, Jörg</subfield><subfield code="d">1944-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)121343391</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Parameterized complexity theory</subfield><subfield code="c">J. Flum ; M. Grohe</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2006</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 493 Seiten</subfield><subfield code="b">Illustrationen, Diagramme</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">Texts in theoretical computer science</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. S. [463] - 475</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</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">Parametrisierte Komplexität</subfield><subfield code="0">(DE-588)4818897-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Parametrisierte Komplexität</subfield><subfield code="0">(DE-588)4818897-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Grohe, Martin</subfield><subfield code="d">1967-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1019542179</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="q">text/html</subfield><subfield code="u">http://deposit.dnb.de/cgi-bin/dokserv?id=2768760&prov=M&dok_var=1&dok_ext=htm</subfield><subfield code="3">Inhaltstext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB 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=014791571&sequence=000001&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-014791571</subfield></datafield></record></collection> |
| id | DE-604.BV021575825 |
| illustrated | Illustrated |
| index_date | 2024-07-02T14:40:00Z |
| indexdate | 2024-11-04T17:00:51Z |
| institution | BVB |
| isbn | 9783540299523 3540299521 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-014791571 |
| oclc_num | 181539305 |
| open_access_boolean | |
| owner | DE-703 DE-19 DE-BY-UBM DE-20 DE-11 DE-384 DE-83 DE-634 DE-739 |
| owner_facet | DE-703 DE-19 DE-BY-UBM DE-20 DE-11 DE-384 DE-83 DE-634 DE-739 |
| physical | XIII, 493 Seiten Illustrationen, Diagramme |
| publishDate | 2006 |
| publishDateSearch | 2006 |
| publishDateSort | 2006 |
| publisher | Springer |
| record_format | marc |
| series2 | Texts in theoretical computer science |
| spelling | Flum, Jörg 1944- Verfasser (DE-588)121343391 aut Parameterized complexity theory J. Flum ; M. Grohe Berlin [u.a.] Springer 2006 XIII, 493 Seiten Illustrationen, Diagramme txt rdacontent n rdamedia nc rdacarrier Texts in theoretical computer science Literaturverz. S. [463] - 475 Algorithms Computational complexity Parametrisierte Komplexität (DE-588)4818897-9 gnd rswk-swf Parametrisierte Komplexität (DE-588)4818897-9 s DE-604 Grohe, Martin 1967- Verfasser (DE-588)1019542179 aut text/html http://deposit.dnb.de/cgi-bin/dokserv?id=2768760&prov=M&dok_var=1&dok_ext=htm Inhaltstext DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=014791571&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Flum, Jörg 1944- Grohe, Martin 1967- Parameterized complexity theory Algorithms Computational complexity Parametrisierte Komplexität (DE-588)4818897-9 gnd |
| subject_GND | (DE-588)4818897-9 |
| title | Parameterized complexity theory |
| title_auth | Parameterized complexity theory |
| title_exact_search | Parameterized complexity theory |
| title_exact_search_txtP | Parameterized complexity theory |
| title_full | Parameterized complexity theory J. Flum ; M. Grohe |
| title_fullStr | Parameterized complexity theory J. Flum ; M. Grohe |
| title_full_unstemmed | Parameterized complexity theory J. Flum ; M. Grohe |
| title_short | Parameterized complexity theory |
| title_sort | parameterized complexity theory |
| topic | Algorithms Computational complexity Parametrisierte Komplexität (DE-588)4818897-9 gnd |
| topic_facet | Algorithms Computational complexity Parametrisierte Komplexität |
| url | http://deposit.dnb.de/cgi-bin/dokserv?id=2768760&prov=M&dok_var=1&dok_ext=htm http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=014791571&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT flumjorg parameterizedcomplexitytheory AT grohemartin parameterizedcomplexitytheory |