|
|
|
|
| LEADER |
03681nmm a2200265 u 4500 |
| 001 |
EB000619998 |
| 003 |
EBX01000000000000000473080 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9781461244004
|
| 100 |
1 |
|
|a Kozen, Dexter C.
|
| 245 |
0 |
0 |
|a The Design and Analysis of Algorithms
|h Elektronische Ressource
|c by Dexter C. Kozen
|
| 250 |
|
|
|a 1st ed. 1992
|
| 260 |
|
|
|a New York, NY
|b Springer New York
|c 1992, 1992
|
| 300 |
|
|
|a X, 322 p
|b online resource
|
| 505 |
0 |
|
|a I Lectures -- 1 Algorithms and Their Complexity -- 2 Topological Sort and MST -- 3 Matroids and Independence -- 4 Depth-First and Breadth-First Search -- 5 Shortest Paths and Transitive Closure -- 6 Kleene Algebra -- 7 More on Kleene Algebra -- 8 Binomial Heaps -- 9 Fibonacci Heaps -- 10 Union-Find -- 11 Analysis of Union-Find -- 12 Splay Trees -- 13 Random Search Trees -- 14 Planar and Plane Graphs -- 15 The Planar Separator Theorem -- 16 Max Flow -- 17 More on Max Flow -- 18 Still More on Max Flow -- 19 Matching -- 20 More on Matching -- 21 Reductions and NP-Completeness -- 22 More on Reductions and NP-Completeness -- 23 More NP-Complete Problems -- 24 Still More NP-Complete Problems -- 25 Cook’s Theorem -- 26 Counting Problems and #P -- 27 Counting Bipartite Matchings -- 28 Parallel Algorithms and NC -- 29 Hypercubes and the Gray Representation -- 30 Integer Arithmetic in NC -- 31 Csanky’s Algorithm -- 32 Chistov’s Algorithm -- 33 Matrix Rank -- 34 Linear Equations and Polynomial GCDs -- 35 The Fast Fourier Transform (FFT) -- 36 Luby’s Algorithm -- 37 Analysis of Luby’s Algorithm -- 38 Miller’s Primality Test -- 39 Analysis of Miller’s Primality Test -- 40 Probabilistic Tests with Polynomials -- II Homework Exercises -- Homework 1 -- Homework 2 -- Homework 3 -- Homework 4 -- Homework 5 -- Homework 6 -- Homework 7 -- Homework 8 -- Homework 9 -- Homework 10 -- Miscellaneous Exercises -- III Homework Solutions -- Homework 1 Solutions -- Homework 2 Solutions -- Homework 3 Solutions -- Homework 4 Solutions -- Homework 5 Solutions -- Homework 6 Solutions -- Homework 7 Solutions -- Homework 8 Solutions -- Homework 9 Solutions -- Homework 10 Solutions -- Solutions to Miscellaneous Exercises
|
| 653 |
|
|
|a Algorithms
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Monographs in Computer Science
|
| 028 |
5 |
0 |
|a 10.1007/978-1-4612-4400-4
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-1-4612-4400-4?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 518.1
|
| 520 |
|
|
|a These are my lecture notes from CS681: Design and Analysis of Algo rithms, a one-semester graduate course I taught at Cornell for three consec utive fall semesters from '88 to '90. The course serves a dual purpose: to cover core material in algorithms for graduate students in computer science preparing for their PhD qualifying exams, and to introduce theory students to some advanced topics in the design and analysis of algorithms. The material is thus a mixture of core and advanced topics. At first I meant these notes to supplement and not supplant a textbook, but over the three years they gradually took on a life of their own. In addition to the notes, I depended heavily on the texts • A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Addison-Wesley, 1975. • M. R. Garey and D. S. Johnson, Computers and Intractibility: A Guide to the Theory of NP-Completeness. w. H. Freeman, 1979. • R. E. Tarjan, Data Structures and Network Algorithms. SIAM Regional Conference Series in Applied Mathematics 44, 1983. and still recommend them as excellent references
|