Simple multivariate polynomial multiplication
From MaRDI portal
Publication:1346473
DOI10.1006/jsco.1994.1042zbMath0831.12004OpenAlexW2028444458MaRDI QIDQ1346473
Publication date: 4 April 1995
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.1994.1042
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (13)
Faster minimization of tardy processing time on a single machine ⋮ Algebraic diagonals and walks: algorithms, bounds, complexity ⋮ Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design ⋮ Modular composition modulo triangular sets and applications ⋮ Implicitization of curves and (hyper)surfaces using predicted support ⋮ Fast systematic encoding of multiplicity codes ⋮ Multi-point evaluation in higher dimensions ⋮ Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes ⋮ Homotopy techniques for multiplication modulo triangular sets ⋮ Faster Polynomial Multiplication via Discrete Fourier Transforms ⋮ Polynomial bounds for invariant functions separating orbits ⋮ Fast arithmetic for triangular sets: from theory to practice ⋮ All secant varieties of the Chow variety are nondefective for cubics and quaternary forms
This page was built for publication: Simple multivariate polynomial multiplication