The following pages link to (Q4352797):
Displaying 42 items.
- 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)
- Properness defects of projection and minimal discriminant variety (Q719760) (← links)
- Evaluation properties of invariant polynomials (Q731933) (← links)
- An algorithm for implicit interpolation (Q744017) (← links)
- Interpolation of polynomials given by straight-line programs (Q1029336) (← links)
- Evaluation techniques for zero-dimensional primary decomposition (Q1030246) (← links)
- Lower bounds for diophantine approximations (Q1358914) (← links)
- Polar varieties, real equation solving, and data structures: the hypersurface case (Q1361872) (← links)
- Straight-line programs in geometric elimination theory (Q1380007) (← links)
- Computing the characteristic polynomial of multivariate polynomial matrices given by straight-line programs (Q1404687) (← links)
- Some speed-ups and speed limits for real algebraic geometry (Q1594829) (← links)
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization (Q1690788) (← links)
- Matrices in elimination theory (Q1808659) (← links)
- Solving degenerate sparse polynomial systems faster (Q1808666) (← 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)
- 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)
- Solving parametric systems of polynomial equations over the reals through Hermite matrices (Q2117425) (← links)
- Solving determinantal systems using homotopy techniques (Q2229744) (← links)
- On types of degenerate critical points of real polynomial functions (Q2284966) (← 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)
- 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)
- Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics (Q2674013) (← 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)
- Effective de Rham cohomology — The general case (Q5225782) (← 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)
- Computing bases of complete intersection rings in Noether position (Q5946450) (← links)
- Further perspectives on elimination (Q6166081) (← links)
- Counting solutions of a polynomial system locally and exactly (Q6170809) (← links)
