31 citations · 45 across the 4 of their papers we have counts for
1 paper · 1 filter
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…