2 citations · 6 across the 7 of their papers we have counts for
1 paper · 2 filters
Boleslaw Kacewicz
We establish essentially optimal bounds on the complexity of initial-value problems in the randomized and quantum settings. For this purpose we define a sequence of new algorithms…