Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation Over Finite Fields

SIAM Journal on Computing - United States
doi 10.1137/0219073
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

A Deterministic Multivariate Interpolation Algorithm for Small Finite Fields

IEEE Transactions on Computers
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
2002English

On Multivariate Polynomial Interpolation

1988English

Solving Sparse Linear Equations Over Finite Fields

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
1986English

Arithmetic Properties of Polynomial Specializations Over Finite Fields

Acta Arithmetica
Number TheoryAlgebra
2009English

Multiplicative Complexity of Polynomial Multiplication Over Finite Fields

1987English

Multivariate Polynomial Interpolation in Newton Forms

SIAM Review
Computational MathematicsApplied MathematicsTheoretical Computer Science
2019English

New Algorithms for Finding Irreducible Polynomials Over Finite Fields

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1990English

On Elementary Estimates of Arithmetic Sums for Polynomial Rings Over Finite Fields

Journal of Number Theory
Number TheoryAlgebra
2019English

On Solving Systems of Diagonal Polynomial Equations Over Finite Fields

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy