Chpater 1 Kuhn's algorithm for algebraic equations.- ? Triangulation and labelling.- ? Complementary pivoting algorithm.- ? Convergence, I.- ? Convergence, II.- 2 Efficiency of Kuhn's algorithm.- ? Error estimate.- ? Cost estimate.- ? Monotonicity problem.- ? Results on monotonicity.- 3 Newton method and approximate zeros.- ? Approximate zeros.- ? Coefficients of polynomials.- ? One step of Newton iteration.- ? Conditions for approximate zeros.- 4 A complexity comparison of Kuhn's algorithm and Newton method.- ? Smale's work on the complexity of Newton method.- ? Set of bad polynomials and its volume estimate.- ? Locate approximate zeros by Kuhn's algorithm.- ? Some remarks.- 5 Incremental algorithms and cost theory.- ? Incremental algorithms Ih,f.- ? Euler's algorithm is of efficiency k.- ? Generalized approximate zeros.- ? Ek iteration.- ? Cost theory of Ek as an Euler's algorithm.- ? Incremental algorithms of efficiency k.- 6 Homotopy algorithms.- ? Homotopies and Index Theorem.- ? Degree and its invariance.- ? Jacobian of polynomial mappings.- ? Conditions for boundedness of solutions.- 7 Probabilistic discussion on zeros of polynomial mappings.- ? Number of zeros of polynomial mappings.- ? Isolated zeros.- ? Locating zeros of analytic functions in bounded regions.- 8 Piecewise linear algorithms.- ? Zeros of PL mapping and their indexes.- ? PL approximations.- ? PL homotopy algorithms work with probability one.- References.- Acknowledgments.