Factoring High-Degree Polynomials Over $\Mathbf F_2$ With Niederreiter's Algorithm on the IBM SP2

Mathematics of Computation - United States
doi 10.1090/s0025-5718-99-01008-x
Full Text
Abstract

Available in full text

Date
Authors
Publisher

American Mathematical Society (AMS)

Related search

Factoring Polynomials Over Finite Fields: A Survey

Journal of Symbolic Computation
Computational MathematicsNumber TheoryAlgebra
2001English

Factoring Polynomials Over Finite Fields Using Differential Equations and Normal Bases

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1994English

Parallel Simulation of the IBM SP2 Interconnection Network

1995English

Hard Functions for Low-Degree Polynomials Over Prime Fields

ACM Transactions on Computation Theory
Computational TheoryTheoretical Computer ScienceMathematics
2013English

Hard Functions for Low-Degree Polynomials Over Prime Fields

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Implementing the Continued Fraction Factoring Algorithm on Parallel Machines

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1985English

The Generic Dimension of Spaces of $\Mathbf{A}$-Harmonic Polynomials

Publicacions Matematiques
Mathematics
2020English

On the Parallel Generation of the Residues for the Continued Fraction Factoring Algorithm

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1987English

An Integer Factoring Algorithm Based on Elliptic Divisibility Sequences

JSIAM Letters
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy