Cohomology of Braid Groups and Complexity

V. A. Vassil’ev

Chapter 34 in From Topology to Computation: Proceedings of the Smalefest, 1993, pp 359-367 from Springer

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

Keywords: Output Node; Braid Group; Polynomial System; Cohomology Ring; Topological Complexity (search for similar items in EconPapers)
Date: 1993
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-2740-3_34

Ordering information: This item can be ordered from
http://www.springer.com/9781461227403

DOI: 10.1007/978-1-4612-2740-3_34

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().