Simple multivariate polynomial multiplication
From MaRDI portal
Publication:1346473
DOI10.1006/jsco.1994.1042zbMath0831.12004MaRDI 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
68Q25: Analysis of algorithms and problem complexity
Related Items
All secant varieties of the Chow variety are nondefective for cubics and quaternary forms, 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, Homotopy techniques for multiplication modulo triangular sets, Fast arithmetic for triangular sets: from theory to practice, Polynomial bounds for invariant functions separating orbits, Multi-point evaluation in higher dimensions, Faster minimization of tardy processing time on a single machine, Fast systematic encoding of multiplicity codes, Algebraic diagonals and walks: algorithms, bounds, complexity, Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes, Faster Polynomial Multiplication via Discrete Fourier Transforms