The following pages link to (Q4352783):
Displayed 20 items.
- Polynomial equation solving by lifting procedures for ramified fibers (Q598210) (← links)
- Deformation techniques to solve generalised Pham systems (Q598226) (← links)
- Deformation techniques for sparse systems (Q1029552) (← links)
- Evaluation techniques for zero-dimensional primary decomposition (Q1030246) (← links)
- A sparse effective Nullstellensatz (Q1291069) (← 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)
- 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)
- Fast computation of discrete invariants associated to a differential rational mapping (Q1878484) (← links)
- Complexity results for triangular sets (Q1878489) (← links)
- Time-space tradeoffs in algebraic complexity theory (Q1977138) (← 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)
- Fast computation of a rational point of a variety over a finite field (Q3420246) (← 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)
- A new method to obtain lower bounds for polynomial evaluation (Q5941294) (← links)