Pages that link to "Item:Q1380007"
From MaRDI portal
The following pages link to Straight-line programs in geometric elimination theory (Q1380007):
Displaying 50 items.
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers (Q272196) (← links)
- Modular composition modulo triangular sets and applications (Q371190) (← links)
- Effective differential Lüroth's theorem (Q402415) (← links)
- Computing isolated roots of sparse polynomial systems in affine space (Q410703) (← 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)
- A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface (Q629823) (← links)
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers (Q652454) (← links)
- Irreducible decomposition of curves (Q697491) (← 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)
- A sparse effective Nullstellensatz (Q1291069) (← links)
- An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs (Q1295548) (← links)
- Lower bounds for diophantine approximations (Q1358914) (← links)
- Bounds for the Hilbert function of polynomial ideals and for the degrees in the Nullstellensatz (Q1358930) (← links)
- Polar varieties, real equation solving, and data structures: the hypersurface case (Q1361872) (← links)
- Foveal detection and approximation for singularities. (Q1399097) (← links)
- Computing the characteristic polynomial of multivariate polynomial matrices given by straight-line programs (Q1404687) (← links)
- Effective equidimensional decomposition of affine varieties (Q1602652) (← links)
- Enumerating a subset of the integer points inside a Minkowski sum (Q1602946) (← links)
- Sparse resultants and straight-line programs (Q1690776) (← links)
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization (Q1690788) (← 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)
- Homotopy techniques for solving sparse column support determinantal polynomial systems (Q1979422) (← links)
- Bit complexity for computing one point in each connected component of a smooth real algebraic set (Q2100045) (← links)
- Computing critical points for invariant algebraic systems (Q2100065) (← links)
- Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems (Q2211202) (← links)
- Solving determinantal systems using homotopy techniques (Q2229744) (← links)
- Intrinsic complexity estimates in polynomial optimization (Q2251913) (← 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)
- Multistationarity in structured reaction networks (Q2417526) (← links)
- A concise proof of the Kronecker polynomial system solver from scratch (Q2427141) (← links)
- Bezoutian and quotient ring structure (Q2456551) (← 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)
