We study the complexity of randomized solution of initial value problems for systems of ordinary differential equations (ODE). The input data are assumed to be -smooth ( = r+ : th...
The deterministic space complexity of approximating the length of the longest increasing subsequence of a stream of N integers is known to be ( N). However, the randomized comple...