11_split_Introduction to Algorithms 2nd Edition

# 11_split_Introduction to Algorithms 2nd Edition - 947 33.4...

This preview shows page 1. Sign up to view the full content.

x Contents 31 Number-Theoretic Algorithms 849 31.1 Elementary number-theoretic notions 850 31.2 Greatest common divisor 856 31.3 Modular arithmetic 862 31.4 Solving modular linear equations 869 31.5 The Chinese remainder theorem 873 31.6 Powers of an element 876 31.7 The RSA public-key cryptosystem 881 ± 31.8 Primality testing 887 ± 31.9 Integer factorization 896 32 String Matching 906 32.1 The naive string-matching algorithm 909 32.2 The Rabin-Karp algorithm 911 32.3 String matching with ﬁnite automata 916 ± 32.4 The Knuth-Morris-Pratt algorithm 923 33 Computational Geometry 933 33.1 Line-segment properties 934 33.2 Determining whether any pair of segments intersects 940 33.3 Finding the convex hull
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 947 33.4 Finding the closest pair of points 957 34 NP-Completeness 966 34.1 Polynomial time 971 34.2 Polynomial-time veriﬁcation 979 34.3 NP-completeness and reducibility 984 34.4 NP-completeness proofs 995 34.5 NP-complete problems 1003 35 Approximation Algorithms 1022 35.1 The vertex-cover problem 1024 35.2 The traveling-salesman problem 1027 35.3 The set-covering problem 1033 35.4 Randomization and linear programming 1039 35.5 The subset-sum problem 1043 VIII Appendix: Mathematical Background Introduction 1057 A Summations 1058 A.1 Summation formulas and properties 1058 A.2 Bounding summations 1062...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online