Sparse polynomials in FLINT

DOI10.1145/3015306.3015314MaRDI QIDQ5270202zbMATH OpenOpenAlexFDO

Authors A. Whitman Groves, Daniel S. Roche

Publication date 22 June 2017

Published in ACM Communications in Computer Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3015306.3015314

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• What can (and can't) we do with sparse polynomials?
• Parallel sparse polynomial multiplication on modern hardware architectures
• Sparse polynomial arithmetic with the BPAS library
• Comparing the speed of programs for sparse polynomial multiplication
• Faster sparse interpolation of straight-line programs

Cites work

• Development of TRIP: Fast Sparse Multivariate Polynomial Multiplication Using Burst Tries
• Interpolation of polynomials given by straight-line programs
• Output-sensitive algorithms for sumset and sparse polynomial multiplication

Cited in

(2)

• What can (and can't) we do with sparse polynomials?
• Fast interpolation of multivariate polynomials with sparse exponents

Describes a project that uses

Uses Software

• SINGULAR
• Magma
• FLINT
• Maple
• Mathemagix
• TRIP

This page was built for publication: Sparse polynomials in FLINT

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