Pages that link to "Item:Q1358914"

The following pages link to Lower bounds for diophantine approximations (Q1358914):

Displaying 46 items.

• Effective differential Lüroth's theorem (Q402415) (← links)
• Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces (Q431820) (← links)
• Relaxed Hensel lifting of triangular sets (Q480691) (← links)
• Polynomial equation solving by lifting procedures for ramified fibers (Q598210) (← links)
• Deformation techniques to solve generalised Pham systems (Q598226) (← links)
• Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers (Q652454) (← links)
• Properness defects of projection and minimal discriminant variety (Q719760) (← links)
• Evaluation properties of invariant polynomials (Q731933) (← links)
• An algorithm for implicit interpolation (Q744017) (← links)
• On sign conditions over real multivariate polynomials (Q977180) (← links)
• A parametric representation of totally mixed Nash equilibria (Q979929) (← links)
• Interpolation of polynomials given by straight-line programs (Q1029336) (← links)
• Deformation techniques for sparse systems (Q1029552) (← links)
• Evaluation techniques for zero-dimensional primary decomposition (Q1030246) (← links)
• A sparse effective Nullstellensatz (Q1291069) (← links)
• Bounds for the Hilbert function of polynomial ideals and for the degrees in the Nullstellensatz (Q1358930) (← links)
• Algorithms for residues and Łojasiewicz exponents (Q1585067) (← links)
• Sparse resultants and straight-line programs (Q1690776) (← links)
• On the bit complexity of polynomial system solving (Q1734694) (← links)
• Functional programming concepts and straight-line programs in computer algebra (Q1849848) (← links)
• Systems of rational polynomial equations have polynomial size approximate zeros on the average (Q1869964) (← links)
• Complexity results for triangular sets (Q1878489) (← links)
• Time-space tradeoffs in algebraic complexity theory (Q1977138) (← links)
• Deformation techniques for efficient polynomial equation solving. (Q1977143) (← links)
• A promenade through correct test sequences. I: Degree of constructible sets, Bézout's inequality and density (Q2052162) (← links)
• Bit complexity for computing one point in each connected component of a smooth real algebraic set (Q2100045) (← links)
• Intrinsic complexity estimates in polynomial optimization (Q2251913) (← links)
• Complexity of solving parametric polynomial systems (Q2256707) (← links)
• Degeneracy loci and polynomial equation solving (Q2340506) (← links)
• Generalized polar varieties: geometry and algorithms (Q2387411) (← links)
• Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study (Q2387419) (← links)
• Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\) (Q2399868) (← links)
• A concise proof of the Kronecker polynomial system solver from scratch (Q2427141) (← links)
• On the probability distribution of singular varieties of given corank (Q2457405) (← links)
• Computing multihomogeneous resultants using straight-line programs (Q2457419) (← links)
• Change of order for regular chains in positive dimension (Q2476011) (← links)
• On the complexity of the resolvent representation of some prime differential ideals (Q2496182) (← links)
• On the complexity exponent of polynomial system solving (Q2658549) (← 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)
• EVALUATION PROPERTIES OF SYMMETRIC POLYNOMIALS (Q5483452) (← links)
• A Gröbner free alternative for polynomial system solving (Q5938584) (← links)
• Kronecker's and Newton's approaches to solving: a first comparison (Q5938585) (← links)
• On computing absolutely irreducible components of algebraic varieties with parameters (Q5962004) (← links)
• Further perspectives on elimination (Q6166081) (← links)