Recommendations
Cites work
- scientific article; zbMATH DE number 412172 (Why is no real title available?)
- scientific article; zbMATH DE number 3114412 (Why is no real title available?)
- scientific article; zbMATH DE number 3144942 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3631581 (Why is no real title available?)
- scientific article; zbMATH DE number 1254302 (Why is no real title available?)
- scientific article; zbMATH DE number 1342334 (Why is no real title available?)
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- scientific article; zbMATH DE number 2191967 (Why is no real title available?)
- scientific article; zbMATH DE number 3246969 (Why is no real title available?)
- scientific article; zbMATH DE number 3086775 (Why is no real title available?)
- scientific article; zbMATH DE number 3090996 (Why is no real title available?)
- Algebraic models for homotopy types
- Algorithmic topology and classification of 3-manifolds
- Algorithmic unsolvability of the triviality problem for multidimensional knots
- An algorithm computing homotopy groups.
- Cohomology and continuous mappings
- Cohomology operations, and obstructions to extending continuous functions
- Computability Theory and Differential Geometry
- Computational topology. An introduction
- Computing spectral sequences
- Constructive algebraic topology
- Embedding and knotting of manifolds in Euclidean spaces
- Finite computability of Postnikov complexes
- Persistent homology -- a survey
- Products of cocycles and extensions of mappings
- Satisfiability of systems of equations of real analytic functions is quasi-decidable
- Simplicial homotopy theory
- Simplicial homotopy theory
- Simplification techniques for maps in simplicial topology
- Stable homotopy groups of spheres. A computer-assisted approach
- Survey article: an elementary illustrated introduction to simplicial sets
- The computability problem in algebraic topology
- Theorie der Normalflächen. Ein Isotopiekriterium für den Kreisknoten
- Topology and data
- Topology for Computing
- polymake: a framework for analyzing convex polytopes
Cited in
(20)- Are two H-spaces homotopy equivalent? An algorithmic view point
- The complexity of recognizing geometric hypergraphs
- Computing simplicial representatives of homotopy group elements
- The complexity of recognizing geometric hypergraphs
- Solving equations and optimization problems with uncertainty
- Are two given maps homotopic? An algorithmic viewpoint
- Extending continuous maps, polynomiality and undecidability
- Algorithmic solvability of the lifting-extension problem
- Extendability of continuous maps is undecidable
- On computability and triviality of well groups
- Sparse Kneser graphs are Hamiltonian
- Cohomology with local coefficients and knotted manifolds
- Strong computable type
- Geometric embeddability of complexes is \(\exists\mathbb{R}\)-complete
- Computing all maps into a sphere
- The computation of megamaps
- Rational homotopy type and computability
- Computing homotopy classes for diagrams
- Mappings of the sphere to a simply connected space
- Decidability of the extension problem for maps into odd-dimensional spheres
This page was built for publication: Computing all maps into a sphere
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189652)
