Pages that link to "Item:Q2576279"
From MaRDI portal
The following pages link to Improved bounds on the randomized and quantum complexity of initial-value problems (Q2576279):
Displaying 10 items.
- Adaptive Itô-Taylor algorithm can optimally approximate the Itô integrals of singular functions (Q711243) (← links)
- The quantum setting with randomized queries for continuous problems (Q850543) (← links)
- Almost optimal solution of initial-value problems by randomized and quantum algorithms (Q855897) (← links)
- Solving Burgers' equation with quantum computing (Q2102229) (← links)
- Turbulence theories and statistical closure approaches (Q2233981) (← links)
- Minimal asymptotic error for one-point approximation of SDEs with time-irregular coefficients (Q2255720) (← links)
- The randomized complexity of initial value problems (Q2483198) (← links)
- On the complexity of searching for a maximum of a function on a quantum computer (Q2491387) (← links)
- Complexity of initial-value problems for ordinary differential equations of order \(k\) (Q2507590) (← links)
- A note on the probabilistic stability of randomized Taylor schemes (Q6105404) (← links)
