Finite computability of Postnikov complexes
From MaRDI portal
Cited in
(28)- Computability of homotopy groups of nilpotent complexes
- p-adic homotopy theory
- The computation of the Betti numbers of an elliptic space is an NP-hard problem
- An algorithm computing homotopy groups.
- Constructive algebraic topology
- A Bousfield-Kan algorithm for computing the \textit{effective} homotopy of a space
- Are two given maps homotopic? An algorithmic viewpoint
- Computing simplicial representatives of homotopy group elements
- Interpolation, the rudimentary geometry of spaces of Lipschitz functions, and geometric complexity
- Algorithmic solvability of the lifting-extension problem
- An implementation of effective homotopy of fibrations
- Extendability of continuous maps is undecidable
- The periodicity theorem for the classical groups and some of its applications
- Cohomology operations, and obstructions to extending continuous functions
- Remarks on the realizability of Whitehead product
- Fifty years of homotopy theory
- Computing all maps into a sphere
- Fibrations and geometric realizations
- La théorie des fonctions récursives et ses applications. (Exposé d'information générale)
- Computing all maps into a sphere
- Computing homotopy classes for diagrams
- Rational homotopy type and computability
- Hardness of embedding simplicial complexes in R^d
- Counting vanishing matrix-vector products
- Automatic generation of cuts on large-sized meshes for the T- geometric eddy-current formulation
- Counting vanishing matrix-vector products
- Are two H-spaces homotopy equivalent? An algorithmic view point
- Effective homotopy of fibrations
This page was built for publication: Finite computability of Postnikov complexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q768506)
