31 citations · 45 across the 4 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
math.AT2013
Are two given maps homotopic? An algorithmic viewpoint
Marek Filakovský, Lukáš Vokřínek
This paper presents two algorithms. In their simplest form, the first algorithm decides the existence of a pointed homotopy between given simplicial maps f, g from X to Y and the s…
math.AT2013
Algorithmic solvability of the lifting-extension problem
Martin Čadek, Marek Krčál, Lukáš Vokřínek
Let and be finite simplicial sets (e.g. finite simplicial complexes), both equipped with a free simplicial action of a finite group . Assuming that is -connected…
cs.CG2013★ 14 cited
Extendability of continuous maps is undecidable
Martin Cadek, Marek Krcal, Jiri Matousek +2
We consider two basic problems of algebraic topology, the extension problem and the computation of higher homotopy groups, from the point of view of computability and computational…