The computation of polynomial greatest common divisors over an algebraic number field (Q582076): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W30 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 11R09 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 4129994 / rank
 
Normal rank
Property / zbMATH Keywords
 
greatest common divisor of two polynomials
Property / zbMATH Keywords: greatest common divisor of two polynomials / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cylindrical Algebraic Decomposition I: The Basic Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Euclid's Algorithm and the Theory of Subresultants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring Polynomials over Algebraic Number Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3326837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3698903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3697106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4391223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3963114 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate formulas for some functions of prime numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring Polynomials Over Algebraic Number Fields / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:11, 20 June 2024

scientific article
Language Label Description Also known as
English
The computation of polynomial greatest common divisors over an algebraic number field
scientific article

    Statements

    The computation of polynomial greatest common divisors over an algebraic number field (English)
    0 references
    0 references
    0 references
    1989
    0 references
    0 references
    0 references
    0 references
    0 references
    greatest common divisor of two polynomials
    0 references