p-adic algorithm for bivariate Gröbner bases (Q6081975): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Topology and arrangement computation of semi-algebraic planar curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular algorithms for computing Gröbner bases. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On constructing bases for ideals in polynomial rings over the integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithm for computing separating linear forms for bivariate systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving bivariate systems using rational univariate representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational univariate representations of bivariate systems and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3325832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical Hilbert-Burch matrices for ideals of \(k[x,y]\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size of coefficients of lexicographical Groöbner bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting techniques for triangular decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp estimates for triangular sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for polynomials on algebraic numbers and application to curve topology / rank
 
Normal rank
Property / cites work
 
Property / cites work: The membership problem for unmixed polynomial ideals is solvable in single exponential time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the asymptotic and practical complexity of solving bivariate systems over the reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some comments on the modular approach to Gröbner-bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of solving a bivariate polynomial system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Algebra in Scientific Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for diophantine approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Straight-line programs in geometric elimination theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Gröbner free alternative for polynomial system solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved upper complexity bound for the topology computation of a real algebraic plane curve / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spans in the module (<i>Z<sub>m</sub></i>)<sup><i>s</i></sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Change of Basis for m-primary Ideals in One and Two Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of computing with planar algebraic curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp Effective Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ideal basis and primary decompositions: case of two variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of solving bivariate systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing syzygies in finite dimension using fast linear algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lucky ideals for Gröbner basis computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving zero-dimensional systems through the rational univariate representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Solving Systems of Bivariate Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing parametric geometric resolutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On improving approximate results of Buchberger's algorithm by Newton's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modern Computer Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A p-adic approach to the computation of Gröbner bases / rank
 
Normal rank

Revision as of 10:53, 3 August 2024

scientific article; zbMATH DE number 7760797
Language Label Description Also known as
English
p-adic algorithm for bivariate Gröbner bases
scientific article; zbMATH DE number 7760797

    Statements

    p-adic algorithm for bivariate Gröbner bases (English)
    0 references
    0 references
    0 references
    3 November 2023
    0 references
    Gröbner basis
    0 references
    Hermite and Howell normal form
    0 references
    \(p\)-adic algorithm
    0 references
    primary components
    0 references
    0 references
    0 references

    Identifiers