New bounds and an efficient algorithm for sparse difference resultants (Q2029018): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: NesSomos / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SparseResultants / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2893627960 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1810.00057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient incremental algorithms for the sparse resultant and the mixed volume / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subdivision-based algorithm for the sparse resultant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5334359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coexistence of competing juvenile–adult structured populations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Macaulay style formulas for sparse resultants / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to generate as many Somos-like miracles as you wish<sup>†</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multihomogeneous resultant formulae for systems with scaled support / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characteristic set method for ordinary difference polynomial systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4293510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On von Neumann regular rings with an automorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse differential resultant for Laurent differential polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse difference resultant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of GCDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective difference elimination and nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Importance of Being Zero / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete May–Leonard Competition Models I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear complete differential resultants and the implicitization of linear DPPEs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Newton polytope of the resultant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differential elimination with Dixon resultants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851616 / rank
 
Normal rank

Latest revision as of 20:54, 25 July 2024

scientific article
Language Label Description Also known as
English
New bounds and an efficient algorithm for sparse difference resultants
scientific article

    Statements

    New bounds and an efficient algorithm for sparse difference resultants (English)
    0 references
    0 references
    0 references
    3 June 2021
    0 references
    sparse difference resultant
    0 references
    Laurent transformally essential system
    0 references
    sparse resultant
    0 references
    complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references