Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Computing higher homotopy groups is W[1]-hard (1304.7705v1)

Published 29 Apr 2013 in cs.CC and cs.CG

Abstract: Recently it was shown that, for every fixed k>1, given a finite simply connected simplicial complex X, the kth homotopy group \pi_k(X) can be computed in time polynomial in the number n of simplices of X. We prove that this problem is W[1]-hard w.r.t. the parameter k even for X of dimension 4, and thus very unlikely to admit an algorithm with running time bound f(k)nC for an absolute constant C. We also simplify, by about 20 pages, a 1989 proof by Anick that, with k part of input, the computation of the rank of \pi_k(X) is #P-hard.

Citations (10)

Summary

We haven't generated a summary for this paper yet.

Youtube Logo Streamline Icon: https://streamlinehq.com