Pages that link to "Item:Q4910727"
From MaRDI portal
The following pages link to Convergence Thresholds of Newton's Method for Monotone Polynomial Equations (Q4910727):
Displaying 9 items.
- Space-efficient scheduling of stochastically generated tasks (Q418125) (← links)
- Runtime analysis of probabilistic programs with unbounded recursion (Q743128) (← links)
- Absolute monotonicity of polynomials occuring in the numerical solution of initial value problems (Q2266574) (← links)
- Runtime Analysis of Probabilistic Programs with Unbounded Recursion (Q3012930) (← links)
- Stochastic Process Creation (Q3182911) (← links)
- Newton’s Method for ω-Continuous Semirings (Q3520300) (← links)
- Newton-like methods and polynomiographic visualization of modified Thakur processes (Q5031267) (← links)
- Certificates for probabilistic pushdown automata via optimistic value iteration (Q6536144) (← links)
- Identity testing for radical expressions (Q6649437) (← links)