arXiv · 1112.0812
Computational complexity of topological invariants
Abstract
We answer the following question posed by Lechuga: Given a simply-connected space $X$ with both $H_*(X,\qq)$ and $π_*(X)\otimes \qq$ being finite-dimensional, what is the computational complexity of an algorithm computing the cup-length and the rational Lusternik--Schnirelmann category of $X$? Basically, by a reduction from the decision problem whether a given graph is $k$-colourable (for $k\geq 3$) we show that (even stricter versions of the) problems above are $\mathbf{NP}$-hard.
Explore related subjects
Keep this discovery
Manuel Amann. 2011-12-05. Computational complexity of topological invariants. https://arxiv.org/abs/1112.0812
Cite the original work for its findings. Save a collection to share your selection of sources.