Complexity issues in bivariate polynomial factorization (Q4657300): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: NTL / rank
 
Normal rank
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.1145/1005285.1005294 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2146298493 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:33, 19 March 2024

scientific article; zbMATH DE number 2144996
Language Label Description Also known as
English
Complexity issues in bivariate polynomial factorization
scientific article; zbMATH DE number 2144996

    Statements

    Complexity issues in bivariate polynomial factorization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    14 March 2005
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references