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