Computing polynomial univariate representations of zero-dimensional ideals by Gröbner basis (Q2392952): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11425-012-4404-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1998550351 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4693774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Root isolation of zero-dimensional polynomial systems with linear univariate representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for computing determinants and resultants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient computation of zero-dimensional Gröbner bases by change of ordering / 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: Gröbner bases of ideals defined by functionals with an application to ideals of projective points / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computation of an arrangement of quadrics in 3D / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modular method to compute the rational univariate representation of zero-dimensional ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational univariate reduction via toric resultants / 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: An efficient algorithm for factoring polynomials over algebraic extension field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3571559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for computing the global infimum and minimum of a polynomial function / rank
 
Normal rank

Latest revision as of 17:53, 6 July 2024

scientific article
Language Label Description Also known as
English
Computing polynomial univariate representations of zero-dimensional ideals by Gröbner basis
scientific article

    Statements

    Computing polynomial univariate representations of zero-dimensional ideals by Gröbner basis (English)
    0 references
    0 references
    0 references
    0 references
    5 August 2013
    0 references
    0 references
    RUR
    0 references
    PUR
    0 references
    zero-dimensional ideals
    0 references
    Gröbner basis
    0 references
    0 references