Computational Complexity of Topological Invariants

DOI10.1017/S0013091514000455zbMath1319.68097arXiv1112.0812MaRDI QIDQ5173078

Manuel Amann

Publication date: 6 February 2015

Published in: Proceedings of the Edinburgh Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

computational complexityLyusternik-Shnirel'man categorycup lengthpure elliptic space

Mathematics Subject Classification ID

Lyusternik-Shnirel'man category of a space, topological complexity à la Farber, topological robotics (topological aspects) (55M30) Rational homotopy theory (55P62) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Non-formal homogeneous spaces

Cites Work

• Unnamed Item
• The computation of the Betti numbers of an elliptic space is an NP-hard problem
• Complexity in rational homotopy

This page was built for publication: Computational Complexity of Topological Invariants