Let $\cal C$ be a space curve defined as the common zeros of $n-1$ polynomials. If $\cal C$ admits a rational parametrisation, what is the complexity of computing a point of the curve given a value of the parameter (in terms of $n$ and the degrees of the polynomials)? I define the complexity as the number of algebraic operations, regardless of the field.