On the complexity of computing Gröbner bases for weighted homogeneous systems (Q5963397): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On variations of the subset sum problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5704414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4693774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Magma algebra system. I: The user language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Converting bases with the Gröbner walk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3629310 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4238966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4317713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new efficient algorithm for computing Gröbner bases \((F_4)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660688 / rank
 
Normal rank
Property / cites work
 
Property / cites work: FGb: A Library for Computing Gröbner Bases / 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: On the complexity of computing gröbner bases for quasi-homogeneous systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using symmetries in the index calculus for elliptic curves discrete logarithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inequality for Hilbert series of graded algebras. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: FGLM-Like Decoding: from Fitzpatrick’s Approach to Recent Developments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A weighted module view of integral closures of affine domains of type I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrevlex Gröbner bases of generic complete intersections. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001741 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic sequences of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Complete Intersections and Their Hilbert Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms in invariant theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hilbert functions and the Buchberger algorithm / rank
 
Normal rank

Latest revision as of 10:46, 11 July 2024

scientific article; zbMATH DE number 6542964
Language Label Description Also known as
English
On the complexity of computing Gröbner bases for weighted homogeneous systems
scientific article; zbMATH DE number 6542964

    Statements

    On the complexity of computing Gröbner bases for weighted homogeneous systems (English)
    0 references
    0 references
    0 references
    0 references
    19 February 2016
    0 references
    Gröbner bases
    0 references
    polynomial system solving
    0 references
    quasi-homogeneous systems
    0 references
    weighted homogeneous systems
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers