Publication:3900988
From MaRDI portal
zbMath0453.68013MaRDI QIDQ3900988
Publication date: 1976
fast algorithms; multivariate polynomials; algebraic manipulation system; dense univariate polynomials
68Q25: Analysis of algorithms and problem complexity
Related Items
All secant varieties of the Chow variety are nondefective for cubics and quaternary forms, More effort towards multiagent knapsack, Impact of Intel's new instruction sets on software implementation of \(GF(2)[x\) multiplication], An alternative class of irreducible polynomials for optimal extension fields, Exact and approximate bandwidth, Parallel multiplication and powering of polynomials, Computing the determinant of a matrix with polynomial entries by approximation, Counting solutions to CSP using generating polynomials, A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers, Gerrymandering on graphs: computational complexity and parameterized algorithms, When NTT meets Karatsuba: preprocess-then-NTT technique revisited