Handbook of Theoretical Computer Science: Algorithms and complexity, Volume 1

Front Cover
Elsevier, 1990 - Computers - 996 pages
0 Reviews
This first part presents chapters on models of computation, complexity theory, data structures, and efficient computation in many recognized sub-disciplines of Theoretical Computer Science.

  

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Peter van EMDE BOAS
3
Karp University of California Berkeley Ch
4
Sequential machine models
16
A Tsakalidis University of Patras Ch
18
The second machine class
38
Parallel machine models outside the second machine class
54
A CATALOG OF COMPLEXITY CLASSES
62
HANDBOOK OF THEORETICAL COMPUTER SCIENCE
63
ALGORITHMS FOR FINDING PATTERNS IN STRINGS
255
DATA STRUCTURES
301
COMPUTATIONAL GEOMETRY
343
ALGORITHMIC MOTION PLANNING IN ROBOTICS
391
AVERAGECASE ANALYSIS OF ALGORITHMS AND DATA STRUCTURES
431
GRAPH ALGORITHMS
525
ALGEBRAIC COMPLEXITY THEORY
633
Algorithms in Number Theory
673

Contents
69
Presumably intractable problems
83
Provably intractable problems
101
Inside P
125
New developments tables and figures
143
HANDBOOK OF THEORETICAL COMPUTER SCIENCE
153
MACHINEINDEPENDENT COMPLEXITY THEORY
163
KOLMOGOROV COMPLEXITY AND ITS APPLICATIONS
187
Cryptography
717
The Complexity of Finite Functions
757
COMMUNICATION NETWORKS
805
VLSI THEORY
835
PARALLEL ALGORITHMS FOR SHAREDMEMORY MACHINES
869
GENERAL PURPOSE PARALLEL ARCHITECTURES
943
SUBJECT INDEX
973
Copyright

Common terms and phrases

References to this book

All Book Search results »

Bibliographic information