Computing all maps into a sphere

zbMath1421.68162arXiv1105.6257MaRDI QIDQ5743373

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

Publication date: 10 May 2019

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

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Homotopy groups, general; sets of homotopy classes (55Q05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Polynomial-time homology for simplicial Eilenberg-MacLane spaces ⋮ Extendability of continuous maps is undecidable

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Survey article: an elementary illustrated introduction to simplicial sets
• Hardness of embedding simplicial complexes in \(\mathbb R^d\)
• Finite computability of Postnikov complexes
• The computability problem in algebraic topology
• Constructive algebraic topology
• Algorithmic unsolvability of the triviality problem for multidimensional knots
• Simplification techniques for maps in simplicial topology
• Computing spectral sequences
• Cohomology operations, and obstructions to extending continuous functions
• Algebraic models for homotopy types
• Cohomology and continuous mappings
• Products of cocycles and extensions of mappings
• Satisfiability of Systems of Equations of Real Analytic Functions Is Quasi-decidable
• Computing All Maps into a Sphere
• Effective algebraic topology
• Topology for Computing
• Computability Theory and Differential Geometry

This page was built for publication: Computing all maps into a sphere