Braid group cohomologies and algorithm complexity

DOI10.1007/BF01077624zbMATH Open0674.68040MaRDI QIDQ1121672FDOQ1121672

Authors: V. A. Vassiliev 

Publication date: 1988

Published in: Functional Analysis and Its Applications (Search for Journal in Brave)

zbMATH Keywords

cohomology groupstopological complexityalgebraic functionssuperpositionscovering projectionrepresentations of symmetric grouplocal coefficientscohomology of braid groupsCoxeter representationsexistence of algorithmhomological genusroots of polynomial

Mathematics Subject Classification ID

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)

Cites Work

• The homology of iterated loop spaces
• On the topology of algorithms. I
• One-dimensional cohomologies of discrete subgroups
• Linear differential equations on a Lie group
• The mod 2 cohomology algebras of symmetric groups

Cited In (13)

• The genus and the category of configuration spaces
• Title not available (Why is that?)
• Title not available (Why is that?)
• Convex equipartitions: the spicy chicken theorem
• On the square peg problem and its relatives
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)