Algorithms and complexity:
Gespeichert in:
| Weitere Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | Undetermined |
| Veröffentlicht: |
Amsterdam [u.a.]
Elsevier
1992
Cambridge, Mass. ; London MIT-Press |
| Ausgabe: | 2. impr. |
| Schriftenreihe: | Handbook of theoretical computer science
A |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | IX, 996 S. graph. Darst. |
| ISBN: | 0444880712 0262220385 |
Internformat
MARC
| LEADER | 00000nam a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV023698670 | ||
| 003 | DE-604 | ||
| 005 | 19981113000000.0 | ||
| 007 | t | ||
| 008 | 970902s1992 ne d||| |||| 00||| und d | ||
| 020 | |a 0444880712 |9 0-444-88071-2 | ||
| 020 | |a 0262220385 |9 0-262-22038-5 | ||
| 035 | |a (OCoLC)258019958 | ||
| 035 | |a (DE-599)BVBBV023698670 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | |a und | ||
| 044 | |a ne |c NL | ||
| 049 | |a DE-522 | ||
| 245 | 1 | 0 | |a Algorithms and complexity |c ed. by Jan van Leeuwen |
| 250 | |a 2. impr. | ||
| 264 | 1 | |a Amsterdam [u.a.] |b Elsevier |c 1992 | |
| 264 | 1 | |a Cambridge, Mass. ; London |b MIT-Press | |
| 300 | |a IX, 996 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Handbook of theoretical computer science |v A | |
| 650 | 0 | 7 | |a Komplexität |0 (DE-588)4135369-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Komplexität |0 (DE-588)4135369-9 |D s |
| 689 | 1 | |5 DE-604 | |
| 700 | 1 | |a Leeuwen, Jan van |4 edt | |
| 830 | 0 | |a Handbook of theoretical computer science |v A |w (DE-604)BV023697308 | |
| 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=017199313&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-017199313 | ||
Datensatz im Suchindex
| _version_ | 1804138723768532992 |
|---|---|
| adam_text | Titel: Algorithms and complexity
Autor: Leeuwen, Jan van
Jahr: 1992
Contents
Preface i
List of Contributors to Volume A iii
Contents v
Chapter 1 Machine Models and Simulations 1
P. van Emde Boas
1. Introduction 3
2. Sequential machine models 16
3. The second machine class 38
4. Parallel machine models outside the second machine class 54
Acknowledgment 60
References 61
Chapter 2 A Catalog of Complexity Classes 67
D.S. Johnson
1. Preliminaries 69
2. Presumably intractable problems 83
3. Provably intractable problems 101
4. Classes that count 106
5. Inside P 125
6. New developments: tables and figures 143
References 152
Chapter 3 Machine-Independent Complexity Theory 163
J.I. Seiferas
1. Introduction 165
2. Simple Turing machines and space complexity 165
3. Recursion, padding and compression 167
4. Gaps and arbitrary speed-up 171
5. Effective speed-up 175
6. Fundamental Theorem for STM space 177
7. Machine independence 178
Acknowledgment 185
References 185
Chapter 4 Kolmogorov Complexity and its Applications 187
M. Li and P.M.B. Vitányi
1. Introduction 189
2. Mathematical theory 196
3. Applications of compressibility 214
vi Contents
4. Example of an application in mathematics: weak prime
number theorems 221
5. Application of incompressibility: proving lower bounds 222
6. Resource-bounded Kolmogorov complexity and its
applications 236
7. Conclusion 247
Acknowledgment 247
References 248
Chapter 5 Algorithms for Finding Patterns in Strings 255
A.V. Aho
1. Introduction 257
2. Notations for patterns 258
3. Matching keywords 262
4. Matching sets of keywords 273
5. Matching regular expressions 282
6. Related problems 288
7. Concluding remarks 295
Acknowledgment 295
References 295
Chapter 6 Data Structures 301
K. Mehlhorn and A. Tsakalidis
1. Introduction 303
2. The dictionary problem 305
3. The weighted dictionary problem and self-organizing data
structures 319
4. Persistence 323
5. The Union-Split-Find problem 324
6. Priority queues 326
7. Nearest common ancestors 328
8. Selection 329
9. Merging 331
10. Dynamization techniques 332
References 334
Chapter 7 Computational Geometry 343
F.F. Yao
1. Introduction 345
2. Techniques and paradigms 345
3. Convex hulls 348
4. Voronoi diagrams 352
5. Proximity problems 356
6. Linear programming 360
7. Triangulation and decomposition 364
8. Planar point location 366
Contents vii
9. Multidimensional trees 368
10. Range search 370
11. Visibility computations 374
12. Combinatorial geometry 376
13. Other topics 378
14. Conclusion 380
References 380
Chapter 8 Algorithmic Motion Planning in Robotics 391
J.T. Schwartz and M. Sharir
1. Introduction 393
2. Statement of the problem 394
3. Motion planning in static and known environments 397
4. Variants of the motion planning problem 415
5. Results in computational geometry relevant to motion planning 421
Acknowledgment 425
References 425
Chapter 9 Average-Case Analysis of Algorithms and Data Structures 431
J.S. Vitter and Ph. Flajolet
0. Introduction 433
1. Combinatorial enumerations 436
2. Asymptotic methods 445
3. Sorting algorithms 458
4. Recursive decompositions and algorithms on trees 473
5. Hashing and address computation techniques 492
6. Dynamic algorithms 511
Acknowledgment 520
References 520
Chapter 10 Graph Algorithms 525
J. van Leeuwen
Prelude 527
1. Representation of graphs 527
2. Basic structure algorithms 551
3. Combinatorial optimization on graphs 579
References 612
Chapter 11 Algebraic Complexity Theory 633
V. Strassen
1. Introduction 635
2. Addition chains 637
3. Computation sequences 637
4. Substitution 638
5. Degree of transcendency 640
6. Geometric degree 641
7. Derivatives 644
viii Contents
8. Branching 645
9. Complexity classes 648
10. Matrix multiplication and bilinear complexity 650
11. Degeneration and asymptotic spectrum 653
12. Lower bounds for rank and border rank 656
13. Fourier transform 660
14. Complete problems 661
15. Conclusion 664
References 664
Chapter 12 Algorithms in Number Theory 673
A.K. Lenstra and H.W. Lenstra, Jr
1. Introduction 675
2. Preliminaries 677
3. Algorithms for finite abelian groups 685
4. Factoring integers 697
5. Primality testing 706
Acknowledgment 712
References 712
Chapter 13 Cryptography 717
R.L. Rivest
1. Introduction 719
2. Basics 719
3. The goals and tools of cryptology 722
4. Mathematical preliminaries 723
5. Complexity-theoretic foundations of cryptography 725
6. Privacy 728
7. Generating random or pseudo-random sequences and functions 735
8. Digital signatures 739
9. Two-party protocols 742
10. Multi-party protocols 746
11. Cryptography and complexity theory 748
Acknowledgment 749
References 750
Chapter 14 The Complexity of Finite Functions 757
R.B. Boppana and M. Sipser
1. Introduction 759
2. General circuits 760
3. Bounded-depth circuits 765
4. Monotone circuits 780
5. Formulas 786
6. Branching programs 796
7. Conclusion 799
Acknowledgment 800
References 800
Contents ix
Chapter 15 Communication Networks 805
N. Pippenger
1. Introduction 807
2. Communication problems 809
3. The Ajtai, Komlós and Szemerédi Theorem 820
Acknowledgment 831
References 831
Chapter 16 VLSI Theory 835
Th. Lengauer
1. Introduction 837
2. VLSI complexity measures 839
3. The VLSI model 842
4. The basic lower bound argument 844
5. A geometric separator theorem 845
6. The communication complexity of Boolean predicates 846
7. The communication complexity of Boolean functions with
many outputs 853
8. A lower bound on the switching energy of VLSI chips 857
9. Upper bounds on the /4 ^-complexity of VLSI chips 862
Acknowledgment 865
References 865
Chapter 17 Parallel Algorithms for Shared-Memory Machines 869
R.M. Karp and V. Ramachandran
1. Introduction 871
2. Efficient PRAM algorithms 873
3. Models of parallel computation 894
4. NC-algorithms and P-complete problems 906
5. Conclusion 931
Acknowledgment 932
References 932
Chapter 18 General Purpose Parallel Architectures 943
L.G. Valiant
1. Introduction 945
2. Some networks 946
3. Routing 950
4. Universality 959
Acknowledgment 968
References 969
Subject Index 973
|
| any_adam_object | 1 |
| author2 | Leeuwen, Jan van |
| author2_role | edt |
| author2_variant | j v l jv jvl |
| author_facet | Leeuwen, Jan van |
| building | Verbundindex |
| bvnumber | BV023698670 |
| ctrlnum | (OCoLC)258019958 (DE-599)BVBBV023698670 |
| edition | 2. impr. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01492nam a2200409zcb4500</leader><controlfield tag="001">BV023698670</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19981113000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">970902s1992 ne d||| |||| 00||| und d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0444880712</subfield><subfield code="9">0-444-88071-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0262220385</subfield><subfield code="9">0-262-22038-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)258019958</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV023698670</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">ne</subfield><subfield code="c">NL</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-522</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms and complexity</subfield><subfield code="c">ed. by Jan van Leeuwen</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">2. impr.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam [u.a.]</subfield><subfield code="b">Elsevier</subfield><subfield code="c">1992</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass. ; London</subfield><subfield code="b">MIT-Press</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">IX, 996 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">Handbook of theoretical computer science</subfield><subfield code="v">A</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</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ät</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Leeuwen, Jan van</subfield><subfield code="4">edt</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Handbook of theoretical computer science</subfield><subfield code="v">A</subfield><subfield code="w">(DE-604)BV023697308</subfield><subfield code="9"></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=017199313&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017199313</subfield></datafield></record></collection> |
| id | DE-604.BV023698670 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T21:32:44Z |
| institution | BVB |
| isbn | 0444880712 0262220385 |
| language | Undetermined |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017199313 |
| oclc_num | 258019958 |
| open_access_boolean | |
| owner | DE-522 |
| owner_facet | DE-522 |
| physical | IX, 996 S. graph. Darst. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| publisher | Elsevier MIT-Press |
| record_format | marc |
| series | Handbook of theoretical computer science |
| series2 | Handbook of theoretical computer science |
| spelling | Algorithms and complexity ed. by Jan van Leeuwen 2. impr. Amsterdam [u.a.] Elsevier 1992 Cambridge, Mass. ; London MIT-Press IX, 996 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Handbook of theoretical computer science A Komplexität (DE-588)4135369-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Algorithmus (DE-588)4001183-5 s DE-604 Komplexität (DE-588)4135369-9 s Leeuwen, Jan van edt Handbook of theoretical computer science A (DE-604)BV023697308 HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017199313&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Algorithms and complexity Handbook of theoretical computer science Komplexität (DE-588)4135369-9 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4135369-9 (DE-588)4001183-5 |
| title | Algorithms and complexity |
| title_auth | Algorithms and complexity |
| title_exact_search | Algorithms and complexity |
| title_full | Algorithms and complexity ed. by Jan van Leeuwen |
| title_fullStr | Algorithms and complexity ed. by Jan van Leeuwen |
| title_full_unstemmed | Algorithms and complexity ed. by Jan van Leeuwen |
| title_short | Algorithms and complexity |
| title_sort | algorithms and complexity |
| topic | Komplexität (DE-588)4135369-9 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Komplexität Algorithmus |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017199313&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV023697308 |
| work_keys_str_mv | AT leeuwenjanvan algorithmsandcomplexity |