44 citations · 279 across the 33 of their papers we have counts for
10 papers · 1 filter
Three-monotone interpolation
Josef Cibulka, Jiří Matoušek, Pavel Paták
A function is called \emph{-monotone} if it is -times differentiable and its nd derivative is convex. A point set $P\subset\mathbb R…
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…
A Doubly Exponentially Crumbled Cake
Tobias Christ, Andrea Francke, Heidi Gebauer +2
We consider the following cake cutting game: Alice chooses a set P of n points in the square (cake) [0,1]^2, where (0,0) is in P; Bob cuts out n axis-parallel rectangles with disjo…