Braid group cohomologies and algorithm complexity
cohomology groupstopological complexityalgebraic functionssuperpositionscovering projectionrepresentations of symmetric grouplocal coefficientscohomology of braid groupsCoxeter representationsexistence of algorithmhomological genusroots of polynomial
Analysis of algorithms and problem complexity (68Q25) Braid groups; Artin groups (20F36) Cohomology of groups (20J06) Eilenberg-Mac Lane spaces (55P20) Covering spaces and low-dimensional topology (57M10) Algorithms in computer science (68W99) Homology of classifying spaces and characteristic classes in algebraic topology (55R40)
- The genus and the category of configuration spaces
- scientific article; zbMATH DE number 503389 (Why is no real title available?)
- scientific article; zbMATH DE number 5380259 (Why is no real title available?)
- Convex equipartitions: the spicy chicken theorem
- On the square peg problem and its relatives
- scientific article; zbMATH DE number 5380256 (Why is no real title available?)
- scientific article; zbMATH DE number 2081063 (Why is no real title available?)
- The set of minimal braids is co-NP-complete
- Dyer-Lashof-Cohen operations in Hochschild cohomology.
- Equivariant topological complexity
- Convex equipartitions via equivariant obstruction theory
- Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision
- Waist of the sphere for maps to manifolds
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)