Semi-numerical absolute factorization of polynomials with integer coefficients (Q2643526): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / cites work
 
Property / cites work: Absolute Factorization of Polynomials: A Geometric Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3919817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Massively parallel search for linear factors in polynomials with many variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast parallel absolute irreducibility testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective Noether irreducibility forms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4128900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate factorization of multivariate polynomials and absolute irreducibility testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4274348 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:13, 26 June 2024

scientific article
Language Label Description Also known as
English
Semi-numerical absolute factorization of polynomials with integer coefficients
scientific article

    Statements

    Semi-numerical absolute factorization of polynomials with integer coefficients (English)
    0 references
    0 references
    24 August 2007
    0 references
    polynomials
    0 references
    algorithm
    0 references

    Identifiers