31 citations · 52 across the 6 of their papers we have counts for
5 papers · 1 filter
Solving equations and optimization problems with uncertainty
Peter Franek, Marek Krčál, Hubert Wagner
We study the problem of detecting zeros of continuous functions that are known only up to an error bound, extending the earlier theoretical work with explicit algorithms and experi…
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…
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…
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…
Computing all maps into a sphere
Martin Čadek, Marek Krčál, Jiří Matoušek +3
Given topological spaces X and Y, a fundamental problem of algebraic topology is understanding the structure of all continuous maps X -> Y . We consider a computational version, wh…