The following pages link to (Q4714022):
Displaying 42 items.
- On the zeta Mahler measure function of the Jacobian determinant, condition numbers and the height of the generic discriminant (Q315740) (← 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)
- Evaluating geometric queries using few arithmetic operations (Q694567) (← links)
- Rational formulas for traces in zero-dimensional algebras (Q733713) (← links)
- Effective approximation of the solutions of algebraic equations (Q820948) (← links)
- Evaluation techniques for zero-dimensional primary decomposition (Q1030246) (← 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)
- Straight-line programs in geometric elimination theory (Q1380007) (← links)
- Computing the characteristic polynomial of multivariate polynomial matrices given by straight-line programs (Q1404687) (← links)
- Algorithms for residues and Łojasiewicz exponents (Q1585067) (← links)
- Condition number bounds for problems with integer coefficients (Q1594828) (← links)
- Effective equidimensional decomposition of affine varieties (Q1602652) (← links)
- Matrices in elimination theory (Q1808659) (← 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)
- Cook's versus Valiant's hypothesis (Q1978701) (← links)
- A promenade through correct test sequences. I: Degree of constructible sets, Bézout's inequality and density (Q2052162) (← links)
- Complexity of solving parametric polynomial systems (Q2256707) (← links)
- Leibniz complexity of Nash functions on differentiations (Q2330984) (← links)
- On the complexity of the \(F_5\) Gröbner basis algorithm (Q2343240) (← links)
- Generalized polar varieties: geometry and algorithms (Q2387411) (← links)
- A concise proof of the Kronecker polynomial system solver from scratch (Q2427141) (← links)
- Bezoutian and quotient ring structure (Q2456551) (← links)
- On the complexity of the resolvent representation of some prime differential ideals (Q2496182) (← links)
- Weak identifiability for differential algebraic systems (Q2701024) (← links)
- Fast computation of a rational point of a variety over a finite field (Q3420246) (← links)
- (Q5389777) (← links)
- On a transfer theorem for the \(\text{P}\neq \text{NP}\) conjecture (Q5938580) (← 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)
- Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy (Q5943088) (← links)
- Computing bases of complete intersection rings in Noether position (Q5946450) (← links)
- Exploring implications of trace (inversion) formula and Artin algebras in extremal combinatorics (Q6139280) (← links)
