Polynomial-Time Computation of Homotopy Groups and Postnikov Systems in Fixed Dimension

DOI10.1137/120899029zbMath1320.68099arXiv1211.3093OpenAlexW2087071350MaRDI QIDQ5173254

Lukáš Vokřínek, Martin Čadek, Marek Krčál, Uli Wagner, Ji{ří} Matoušek

Publication date: 9 February 2015

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1211.3093

zbMATH Keywords

computational complexityalgebraic topologyhomotopy theoryhomotopy groupsPostnikov systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Homotopy groups, general; sets of homotopy classes (55Q05)

Related Items (14)

Algorithmic solvability of the lifting-extension problem ⋮ Solving equations and optimization problems with uncertainty ⋮ Computing homotopy classes for diagrams ⋮ Rational homotopy type and computability ⋮ Efficient simplicial replacement of semialgebraic sets ⋮ Unnamed Item ⋮ Polynomial-time homology for simplicial Eilenberg-MacLane spaces ⋮ Extendability of continuous maps is undecidable ⋮ Decidability of the extension problem for maps into odd-dimensional spheres ⋮ Cohomology with local coefficients and knotted manifolds ⋮ Unnamed Item ⋮ Computation of Cubical Steenrod Squares ⋮ Are two given maps homotopic? An algorithmic viewpoint ⋮ Computing simplicial representatives of homotopy group elements

This page was built for publication: Polynomial-Time Computation of Homotopy Groups and Postnikov Systems in Fixed Dimension