Problem 2.3 — Find an algorithm to compute the distance d(φ) of an arbitrary element φ∈M.
Statement
Find an algorithm to compute the distance d(φ) of an arbitrary element φ∈M. We note that an algorithm to compute shortest paths between fixed vertices v,w in the curve complex has been presented by Shackleton in [45]. That problem is a small piece of the problem of computing the distance.
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.