Parberry I., University of North Texas, 2001, -118 p. Contents: Induction. Correctness. Analysis. Divide and Conquer. Dynamic Programming. Greedy Algorithms. Backtracking. NP completeness.
Gács P., Lovász L. 1999. -180 p. Contents: Introduction and Preliminaries Models of Computation Algorithmic decidability Computation with resource bounds General theorems on space and time complexity Non-deterministic algorithms Randomized algorithms Information complexity: the complexity-theoretic notion of randomness Pseudo-random numbers An application of complexity:...
Comments