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