Skip to main content
SpringerLink
Log in
Book cover

From Topology to Computation: Proceedings of the Smalefest pp 359–367Cite as

Cohomology of Braid Groups and Complexity

  • Chapter

  • 647 Accesses

Abstract

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

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Blum, M. Shub, S. Smale, On a theory of computations over the real numbers; NP-completeness, recursive functions and universal machines, Bull. AMS 21: 1 (1989), 1–46.

    Article  MathSciNet  MATH  Google Scholar 

  2. D.B. Fuchs, Cohomology of braid groups mod 2, Funct. Anal. Appl. 4: 2(1970), 46–59.

    Google Scholar 

  3. Michael D. Hirsch, Applications of topology to lower bound estimates in computer science, preprint, International Computer Science Institute, 1990.

    Google Scholar 

  4. M.-H. Kim, Topological complexity of root-finding algorithms, J.Complexity 5: 3 (1989), 331–344.

    Article  MathSciNet  MATH  Google Scholar 

  5. H. Levine, A lower bound for the topological complexity of Poly(D, n), J. Complexity 5 (1989) 34–44.

    Article  MathSciNet  MATH  Google Scholar 

  6. A.S. Schwarz, The genus of a fibre bundle, Trans. Moscow Math. Soc. 10 (1961) 217–272.

    Google Scholar 

  7. G.B. Segal, Configuration-spaces and iterates loop-spaces, Invent. Math. 21: 3 (1973) 213–221.

    Article  MathSciNet  MATH  Google Scholar 

  8. S. Smale, On the topology of algorithms. I, J. Complexity 3: 2 (1987) 81–90.

    Article  MathSciNet  MATH  Google Scholar 

  9. V.A. Vasiliev, Cohomology of braid groups and complexity of algorithms, Funct. Anal. Appl. 22:3 (1988), 15–24.

    MathSciNet  Google Scholar 

  10. ———, Topological complexity of algorithms of approximate solving the systems of polynomial equations, Algebra Anal. 1:6 (1989) 198–213.

    Google Scholar 

  11. ———, Topology of complements to discriminants and the loop-spaces, in Theory of Singularities and its Applications (V.I. Arnold, ed.), spaces, Advances in Soviet Mathematics, Vol. I, Publ. AMS, 1990, 9–21.

    Google Scholar 

  12. ———, Topology of the spaces of functions without complicated singularities, Funct. Anal. Appl. 23:4 (1989), 24–36.

    MathSciNet  Google Scholar 

Download references

Authors
  1. V. A. Vassil’ev
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, University of California, 94720, Berkeley, CA, USA

    Morris W. Hirsch

  2. Department of Mathematics, University of California, 94720, Berkeley, CA, USA

    Jerrold E. Marsden

  3. IBM Research, T.J. Watson Research Center, 10598-0218, Yorktown Heights, NY, USA

    Michael Shub

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag New York, Inc.

About this chapter

Cite this chapter

Vassil’ev, V.A. (1993). Cohomology of Braid Groups and Complexity. In: Hirsch, M.W., Marsden, J.E., Shub, M. (eds) From Topology to Computation: Proceedings of the Smalefest. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-2740-3_34

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-2740-3_34

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-7648-7

  • Online ISBN: 978-1-4612-2740-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation