Algorithms and Complexity

Front Cover
Elsevier, Jun 28, 2014 - Mathematics - 260 pages
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.
 

Contents

CHAPTER 2 A Catalog of Complexity Classes
67
CHAPTER 3 MachineIndependent Complexity Theory
163
CHAPTER 4 Kolmogorov Complexity and its Applications
187
CHAPTER 5 Algorithms for Finding Patterns in Strings
255
CHAPTER 6 Data Structures
301
CHAPTER 7 Computational Geometry
343
CHAPTER 8 Algorithmic Motion Planning in Robotics
391
CHAPTER 9 AverageCase Analysis of Algorithms and Data Structures
431
CHAPTER 12 Algorithms in Number Theory
673
CHAPTER 13 Cryptography
717
CHAPTER 14 The Complexity of Finite Functions
757
CHAPTER 15 Communication Networks
805
CHAPTER 16 VLSI Theory
835
CHAPTER 17 Parallel Algorithmsfor SharedMemory Machines
869
CHAPTER 18 General Purpose Parallel Architectures
943
Subject Index
973

CHAPTER 10 Graph Algorithms
525
CHAPTER 11 Algebraic Complexity Theory
633

Common terms and phrases