Interval partitions and polynomial factorization

DOI10.1007/S00453-011-9537-YMaRDI QIDQ2429339zbMATH OpenOpenAlexFDO

Authors Joachim von zur Gathen, Daniel Panario, Bruce Richmond

Publication date 26 April 2012

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-011-9537-y

zbMATH Keywords

asymptotic analysisgenerating functionsaverage-case analysisfinite fieldspolynomial factorization

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials in real and complex fields: factorization (12D05)

Recommendations

• scientific article; zbMATH DE number 3880116
• Publication:4892927
• A new polynomial factorization algorithm and its implementation
• Subquadratic-time factoring of polynomials over finite fields
• A generalisation of the Cantor-Zassenhaus algorithm

Cites work

• scientific article; zbMATH DE number 3882549 (Why is no real title available?)
• scientific article; zbMATH DE number 5575550 (Why is no real title available?)
• scientific article; zbMATH DE number 1254267 (Why is no real title available?)
• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• scientific article; zbMATH DE number 2124954 (Why is no real title available?)
• scientific article; zbMATH DE number 815575 (Why is no real title available?)
• scientific article; zbMATH DE number 863491 (Why is no real title available?)
• scientific article; zbMATH DE number 3273551 (Why is no real title available?)
• A New Algorithm for Factoring Polynomials Over Finite Fields
• A hybrid of Darboux's method and singularity analysis in combinatorial asymptotics
• A new polynomial factorization algorithm and its implementation
• Analytic combinatorics
• Computing Frobenius maps and factoring polynomials
• Factoring a binary polynomial of degree over one million
• Factoring polynomials over finite fields: A survey
• Fast Algorithms for Manipulating Formal Power Series
• Polynomial factorization over ${\mathbb F}_2$
• Singularity Analysis of Generating Functions
• Subquadratic-time factoring of polynomials over finite fields
• The complete analysis of a polynomial factorization algorithm over finite fields

Cited in

(3)

• scientific article; zbMATH DE number 1996335 (Why is no real title available?)
• Interval partitions and Stanley depth
• Interval partitions and activities for the greedoid Tutte polynomial

This page was built for publication: Interval partitions and polynomial factorization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2429339)