Pages that link to "Item:Q1336478"
From MaRDI portal
The following pages link to Combining binary search and Newton's method to compute real roots for a class of real functions (Q1336478):
Displayed 6 items.
- A new solution method for the finite-horizon discrete-time EOQ problem (Q1011324) (← links)
- On the complexity of approximating a KKT point of quadratic programming (Q1380927) (← links)
- Some speed-ups and speed limits for real algebraic geometry (Q1594829) (← links)
- On solving univariate sparse polynomials in logarithmic time (Q1763426) (← links)
- Solving degenerate sparse polynomial systems faster (Q1808666) (← links)
- The trust region subproblem and semidefinite programming* (Q4673323) (← links)