The following pages link to Marek Krčál (Q306505):
Displaying 18 items.
- On computability and triviality of well groups (Q306506) (← links)
- Persistence of zero sets (Q1689742) (← links)
- On the geometric Ramsey number of outerplanar graphs (Q2256584) (← links)
- Algorithmic solvability of the lifting-extension problem (Q2358826) (← links)
- Polynomial-time homology for simplicial Eilenberg-MacLane spaces (Q2441425) (← links)
- Extendability of continuous maps is undecidable (Q2441584) (← links)
- Graph balancing: a special case of scheduling unrelated parallel machines (Q2441586) (← links)
- Computation of Cubical Steenrod Squares (Q2815195) (← links)
- Robust Satisfiability of Systems of Equations (Q3177731) (← links)
- Computing All Maps into a Sphere (Q3189652) (← links)
- (Q3579372) (← links)
- Polynomial-Time Computation of Homotopy Groups and Postnikov Systems in Fixed Dimension (Q5173254) (← links)
- On Computability and Triviality of Well Groups (Q5368733) (← links)
- Robust Satisfiability of Systems of Equations (Q5383973) (← links)
- (Q5419961) (← links)
- Extending continuous maps (Q5495830) (← links)
- Packing directed cycles through a specified vertex set (Q5741735) (← links)
- Computing all maps into a sphere (Q5743373) (← links)
