Polynomial-time homology for simplicial Eilenberg-MacLane spaces
From MaRDI portal
Publication:2441425
DOI10.1007/s10208-013-9159-7zbMath1295.68201arXiv1201.6222MaRDI QIDQ2441425
Francis Sergeraert, Marek Krčál, Ji{ří} Matoušek
Publication date: 24 March 2014
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1201.6222
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
55S45: Postnikov systems, (k)-invariants
55S37: Classification of mappings in algebraic topology
Related Items
Solving equations and optimization problems with uncertainty, A Bousfield-Kan algorithm for computing the \textit{effective} homotopy of a space, Cohomology with local coefficients and knotted manifolds, Computing simplicial representatives of homotopy group elements, Extendability of continuous maps is undecidable
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Computing the homology of groups: the geometric way.
- Survey article: an elementary illustrated introduction to simplicial sets
- The computability problem in algebraic topology
- Morse theory for cell complexes
- A user's guide to discrete Morse theory
- Constructive algebraic topology
- fKenzo: a user interface for computations in algebraic topology
- Extendability of continuous maps is undecidable
- Computing spectral sequences
- On the groups \(H(\Pi,n)\). I
- Cohomologie modulo 2 des complexes d'Eilenberg-MacLane
- Satisfiability of Systems of Equations of Real Analytic Functions Is Quasi-decidable
- Polynomial-Time Computation of Homotopy Groups and Postnikov Systems in Fixed Dimension
- Computing all maps into a sphere
- Simplicial homotopy theory
- Simplicial homotopy theory