On the Complexity of the Montes Ideal Factorization Algorithm (Q4931648): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Maple / 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.1007/978-3-642-14518-6_16 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1517477680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5550483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring Polynomials Over Large Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: On fast multiplication of polynomials over arbitrary algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Factoring Polynomials Over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for polynomial factorization over \(\mathbb Q_p\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4248250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton polygons of higher order in algebraic number theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a theorem of Ore / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials over local fields. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast multiplication of large numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast construction of irreducible polynomials over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4103629 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:19, 3 July 2024

scientific article; zbMATH DE number 5793679
Language Label Description Also known as
English
On the Complexity of the Montes Ideal Factorization Algorithm
scientific article; zbMATH DE number 5793679

    Statements

    On the Complexity of the Montes Ideal Factorization Algorithm (English)
    0 references
    29 September 2010
    0 references
    0 references
    complexity of polynomial factorization
    0 references
    Montes ideal factorization algorithm
    0 references
    0 references