44 citations · 279 across the 33 of their papers we have counts for
Showing 2012 · cs.CGShow all
2 papers · 2 filters
cs.CG2012★ 31 cited
Polynomial-time computation of homotopy groups and Postnikov systems in fixed dimension
Martin Cadek, Marek Krcal, Jiri Matousek +2
For several computational problems in homotopy theory, we obtain algorithms with running time polynomial in the input size. In particular, for every fixed k>1, there is a polynomia…
cs.CG2012
Polynomial-time homology for simplicial Eilenberg-MacLane spaces
Marek Krcal, Jiri Matousek, Francis Sergeraert
In an earlier paper of Cadek, Vokrinek, Wagner, and the present authors, we investigated an algorithmic problem in computational algebraic topology, namely, the computation of all…