Braid group cohomologies and algorithm complexity
algebraic functionscohomology groupscohomology of braid groupscovering projectionCoxeter representationsexistence of algorithmhomological genuslocal coefficientsrepresentations of symmetric grouproots of polynomialsuperpositionstopological complexity
Braid groups; Artin groups (20F36) Cohomology of groups (20J06) Eilenberg-Mac Lane spaces (55P20) Homology of classifying spaces and characteristic classes in algebraic topology (55R40) Covering spaces and low-dimensional topology (57M10) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)
See the review in Zbl 0659.68071.
- Equivariant topological complexity
- Convex equipartitions via equivariant obstruction theory
- Convex equipartitions: the spicy chicken theorem
- The set of minimal braids is co-NP-complete
- scientific article; zbMATH DE number 5380256 (Why is no real title available?)
- scientific article; zbMATH DE number 5380259 (Why is no real title available?)
- Waist of the sphere for maps to manifolds
- scientific article; zbMATH DE number 503389 (Why is no real title available?)
- scientific article; zbMATH DE number 2081063 (Why is no real title available?)
- Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision
- On the square peg problem and its relatives
- Convex fair partitions into an arbitrary number of pieces
- The genus and the category of configuration spaces
- Dyer-Lashof-Cohen operations in Hochschild cohomology.
This page was built for publication: Braid group cohomologies and algorithm complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121672)