The following pages link to Juan Sabia (Q250255):
Displayed 49 items.
- Computing isolated roots of sparse polynomial systems in affine space (Q410703) (← links)
- Item:Q250255 (redirect page) (← links)
- On intrinsic bounds in the Nullstellensatz (Q677560) (← links)
- On sign conditions over real multivariate polynomials (Q977180) (← links)
- A parametric representation of totally mixed Nash equilibria (Q979929) (← links)
- Decomposing polynomial systems into simple systems (Q1264446) (← links)
- Systems of algebraic equations with bad reduction (Q1264468) (← links)
- Reduced Gröbner bases under composition (Q1269748) (← links)
- Factors of iterated resultants and discriminants (Q1283193) (← links)
- Sheaf cohomology is \(\#\)P-hard (Q1283198) (← links)
- An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs (Q1295548) (← links)
- Solving multivariate algebraic equation by Hensel construction (Q1301578) (← links)
- Algorithms in SINGULAR (Q1382072) (← links)
- Fast algorithms for zero-dimensional polynomial systems using duality (Q1422204) (← links)
- Computing parametric geometric resolutions (Q1566400) (← links)
- On the number of sets definable by polynomials (Q1569817) (← links)
- Generalized resultants over unirational algebraic varieties (Q1569828) (← links)
- Applications of some properties of the canonical module in computational projective algebraic geometry (Q1569829) (← links)
- Minimally generating ideals of points in polynomial time using linear algebra (Q1576994) (← links)
- Quantifier elimination for trigonometric polynomials by cylindrical trigonometric decomposition (Q1581134) (← links)
- Minimally generating ideals of rational parametric curves in polynomial time (Q1582298) (← links)
- Algorithms for residues and Łojasiewicz exponents (Q1585067) (← links)
- A fast algorithm for Gröbner basis conversion and its applications (Q1588033) (← links)
- Effective equidimensional decomposition of affine varieties (Q1602652) (← links)
- Sparse resultants and straight-line programs (Q1690776) (← links)
- On the theories of triangular sets (Q1808664) (← links)
- Triangular sets for solving polynomial systems: a comparative implementation of four methods (Q1808665) (← links)
- The computational complexity of the Chow form (Q1879037) (← links)
- Bounds of traces in complete intersections and degrees in the Nullstellensatz (Q1901475) (← links)
- Affine solution sets of sparse polynomial systems (Q1940920) (← links)
- Effective Nullstellensatz for arbitrary ideals (Q1963839) (← links)
- An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals (Q1974694) (← links)
- Deformation techniques for efficient polynomial equation solving. (Q1977143) (← links)
- Elimination for generic sparse polynomial systems (Q2249474) (← links)
- On degree bounds for the sparse Nullstellensatz (Q2312873) (← links)
- On the multiplicity of isolated roots of sparse polynomial systems (Q2334502) (← links)
- On the efficiency of effective Nullstellensätze (Q2366723) (← links)
- Computing multihomogeneous resultants using straight-line programs (Q2457419) (← links)
- Real roots of univariate polynomials and straight line programs (Q2466010) (← links)
- Computing Chow Forms and Some Applications (Q2765956) (← links)
- (Q2767720) (← links)
- Puiseux Expansions and Nonisolated Points in Algebraic Varieties (Q2813651) (← links)
- (Q3107094) (← links)
- (Q3513975) (← links)
- Probabilistic equidimensional decomposition (Q4519187) (← links)
- (Q5505189) (← links)
- Zero counting for a class of univariate Pfaffian functions (Q5964515) (← links)
- On the zeros of univariate E-polynomials (Q6070540) (← links)
- Decision problem for a class of univariate Pfaffian functions (Q6122406) (← links)