An efficient algorithm for factoring polynomials over algebraic extension field (Q365855): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(10 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Ding-Kang Wang / rank
Normal rank
 
Property / author
 
Property / author: Ding-Kang Wang / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 12Y05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 12E05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 13P10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6207067 / rank
 
Normal rank
Property / zbMATH Keywords
 
algorithm
Property / zbMATH Keywords: algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
factorization
Property / zbMATH Keywords: factorization / rank
 
Normal rank
Property / zbMATH Keywords
 
algebraic extension field
Property / zbMATH Keywords: algebraic extension field / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Magma / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ISOLATE / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2099330996 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0907.2300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark on factorisation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial factorisation: an exploration of Lenstra's algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing GCDs of polynomials over algebraic number fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226973 / 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: Q2747393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primary decomposition of zero-dimensional ideals over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for polynomial GCD computation over algebraic function fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3668871 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3971984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring Polynomials over Algebraic Number Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computation of polynomial greatest common divisors over an algebraic number field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring Multivariate Polynomials over Algebraic Number Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5702264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the primary decomposition of zero-dimensional ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of prime decomposition of polynomial ideals over small finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conquering inseparability: primary decomposition and multivariate factorization over algebraic function fields of positive characteristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3963106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Multivariate Polynomial Factoring Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Basic principles of mechanical theorem proving in elementary geometries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5427316 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:18, 6 July 2024

scientific article
Language Label Description Also known as
English
An efficient algorithm for factoring polynomials over algebraic extension field
scientific article

    Statements

    An efficient algorithm for factoring polynomials over algebraic extension field (English)
    0 references
    0 references
    0 references
    9 September 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    algorithm
    0 references
    factorization
    0 references
    algebraic extension field
    0 references
    0 references
    0 references
    0 references
    0 references