Pages that link to "Item:Q1430505"
From MaRDI portal
The following pages link to The hardness of polynomial equation solving (Q1430505):
Displaying 9 items.
- Quiz games as a model for information hiding (Q272185) (← links)
- On the zeta Mahler measure function of the Jacobian determinant, condition numbers and the height of the generic discriminant (Q315740) (← links)
- Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces (Q431820) (← links)
- Polynomial equation solving by lifting procedures for ramified fibers (Q598210) (← links)
- Deformation techniques to solve generalised Pham systems (Q598226) (← links)
- Fast linear homotopy to find approximate zeros of polynomial systems (Q626447) (← links)
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers (Q652454) (← links)
- On the solution of the polynomial systems arising in the discretization of certain ODEs (Q836949) (← links)
- Approximation of the solution of certain nonlinear ODEs with linear complexity (Q847187) (← links)
