Modular algorithm for sparse multivariate polynomial interpolation and its parallel implementation

DOI10.1006/JSCO.1996.0020MaRDI QIDQ2564819zbMATH OpenOpenAlexFDO

Authors Hirokazu Murao, Tetsuro Fujise

Publication date 22 January 1997

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jsco.1996.0020

zbMATH Keywords

concurrent logic programming language KL1

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 1263395
• Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields
• A fast parallel sparse polynomial GCD algorithm
• scientific article; zbMATH DE number 871950

Cited in

(7)

• A fast parallel sparse polynomial GCD algorithm
• Faster sparse multivariate polynomial interpolation of straight-line programs
• Parallel computation of determinants of matrices with polynomial entries
• scientific article; zbMATH DE number 1263395 (Why is no real title available?)
• Fast interpolation of multivariate polynomials with sparse exponents
• Sparse polynomial interpolation: faster strategies over finite fields
• Fast interpolation and multiplication of unbalanced polynomials

Describes a project that uses

Uses Software

• KLIC

This page was built for publication: Modular algorithm for sparse multivariate polynomial interpolation and its parallel implementation

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