论文信息 - Cohomology of Braid Groups and Complexity - 字舞流文

Cohomology of Braid Groups and Complexity

The main subject of this talk is the following: The Topological Complexity of Algorithms Finding the Roots of Polynomials and Polynomial Systems.

V. A. Vassil’ev

[1] S. Smale,et al. On a theory of computation and complexity over the real numbers; np-completeness , 1989 .

[2] Myong-Hi Kim. Topological complexity of a root finding algorithm , 1989, J. Complex..

[3] V. A. Vasil'ev,et al. Braid group cohomologies and algorithm complexity , 1988 .

[4] V. I. Arnolʹd. The Theory of Singularities and its Applications , 1991 .

[5] Victor A. Vassiliev. Topology of complements to discriminants and loop spaces , 1990 .

[6] Michael David Hirsch. Applications of topology to lower bound estimates in computer science , 1991 .

[7] Graeme Segal,et al. Configuration-spaces and iterated loop-spaces , 1973 .

[8] Harold Levine. A lower bound for the topological complexity of poly(D, n) , 1989, J. Complex..

[9] Stephen Smale,et al. On the topology of algorithms, I , 1987, J. Complex..