The following pages link to Gema Maria Diaz Toca (Q831960):
Displaying 50 items.
- (Q207156) (redirect page) (← links)
- A new method to compute the singularities of offsets to rational plane curves (Q492111) (← links)
- Direct symbolic transformation from 3D Cartesian into hyperboloidal coordinates (Q529925) (← links)
- Dynamic Galois theory (Q607055) (← links)
- (Q631047) (redirect page) (← links)
- Topology of 2D and 3D rational curves (Q631048) (← links)
- On the shape of curves that are rational in polar coordinates (Q691777) (← links)
- Blind image deconvolution through Bezoutians (Q729853) (← links)
- Computational schemes for subresultant chains (Q831961) (← links)
- Bezout matrices, subresultant polynomials and parameters (Q833155) (← links)
- Algorithms for curves with one place at infinity (Q898275) (← links)
- Matrix-F5 algorithms and tropical Gröbner bases computation (Q1635284) (← links)
- Resultant elimination via implicit equation interpolation (Q1691953) (← links)
- The equivalent representation of the breadth-one \(D\)-invariant polynomial subspace and its discretization (Q1691954) (← links)
- Detection of special curves via the double resultant (Q1707520) (← links)
- A package for computations with classical resultants (Q1755194) (← links)
- ExteriorIdeals: a package for computing monomial ideals in an exterior algebra (Q1755199) (← links)
- Various new expressions for subresultants and their applications (Q1762553) (← links)
- The Sylvester and Bézout resultant matrices for blind image deconvolution (Q1799667) (← links)
- Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices (Q1864875) (← links)
- Using implicit equations of parametric curves and surfaces without computing them: Polynomial algebra by values (Q1932569) (← links)
- Homotopy techniques for solving sparse column support determinantal polynomial systems (Q1979422) (← links)
- A fast parallel sparse polynomial GCD algorithm (Q1994882) (← links)
- Guessing Gröbner bases of structured ideals of relations of sequences (Q2066951) (← links)
- Envelopes and offsets of two algebraic plane curves: exploration of their similarities and differences (Q2071535) (← links)
- Solving the interference problem for ellipses and ellipsoids: new formulae (Q2075971) (← links)
- An interpolation algorithm for computing Dixon resultants (Q2109984) (← links)
- Multigraded Sylvester forms, duality and elimination matrices (Q2168825) (← links)
- Computing the topology of a plane or space hyperelliptic curve (Q2174086) (← links)
- The range of all regularities for polynomial ideals with a given Hilbert function (Q2209288) (← links)
- Critical loci in computer vision and matrices dropping rank in codimension one (Q2220190) (← links)
- Computing the form of highest degree of the implicit equation of a rational surface (Q2221785) (← links)
- Intersection multiplicity of a sparse curve and a low-degree curve (Q2301455) (← links)
- Generalized matrix calculation over Prüfer domains (Q2305854) (← links)
- The geometry of gaussoids (Q2317379) (← links)
- On the multiplicity of isolated roots of sparse polynomial systems (Q2334502) (← links)
- The Bézout matrix for Hermite interpolants (Q2341815) (← links)
- An algebraic framework for computing the topology of offsets to rational curves (Q2357689) (← links)
- Invariants of the orthosymplectic Lie superalgebra and super Pfaffians (Q2406012) (← links)
- A polynomial bound on the number of comaximal localizations needed in order to make free a projective module (Q2431196) (← links)
- Computing the topology of a real algebraic plane curve whose defining equations are available only ``by values'' (Q2443066) (← links)
- Galois theory, splitting fields and computer algebra (Q2457393) (← links)
- The Berlekamp-Massey algorithm revisited (Q2502174) (← links)
- Finite type projective modules, crossed linear maps and generalized inverses. (Modules projectifs de type fini, applications linéaires croisées et inverses généralisés) (Q2509264) (← links)
- Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases (Q2576217) (← links)
- Block diagonalization and LU-equivalence of Hankel matrices (Q2576218) (← links)
- Multigraded Cayley-Chow forms (Q2631948) (← links)
- Rewriting input expressions in complex algebraic geometry provers (Q2631957) (← links)
- An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form (Q2674009) (← links)
- (Q2931733) (← links)
