Pages that link to "Item:Q1430505"
From MaRDI portal
The following pages link to The hardness of polynomial equation solving (Q1430505):
Displaying 25 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)
- On the intrinsic complexity of point finding in real singular hypersurfaces (Q990944) (← links)
- Some lower bounds for the complexity of the linear programming feasibility problem over the reals (Q998976) (← links)
- Deformation techniques for sparse systems (Q1029552) (← links)
- On the bit complexity of polynomial system solving (Q1734694) (← links)
- Systems of rational polynomial equations have polynomial size approximate zeros on the average (Q1869964) (← links)
- Fast computation of discrete invariants associated to a differential rational mapping (Q1878484) (← links)
- A promenade through correct test sequences. I: Degree of constructible sets, Bézout's inequality and density (Q2052162) (← links)
- On the geometry of polar varieties (Q2267371) (← links)
- Generalized polar varieties: geometry and algorithms (Q2387411) (← links)
- Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study (Q2387419) (← links)
- A concise proof of the Kronecker polynomial system solver from scratch (Q2427141) (← links)
- Lower complexity bounds for interpolation algorithms (Q2431336) (← links)
- An arithmetic Poisson formula for the multi-variate resultant (Q2441516) (← links)
- Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity (Q2871188) (← links)
- Fast computation of a rational point of a variety over a finite field (Q3420246) (← links)
- (Q5389777) (← links)
