scientific article; zbMATH DE number 3709576
From MaRDI portal
Publication:3900988
Cited in
(15)- 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
- Impact of Intel's new instruction sets on software implementation of \(GF(2)[x]\) multiplication
- All secant varieties of the Chow variety are nondefective for cubics and quaternary forms
- An alternative class of irreducible polynomials for optimal extension fields
- Even more effort towards improved bounds and fixed-parameter tractability for multiwinner rules
- More effort towards multiagent knapsack
- Improved resultant attack against arithmetization-oriented primitives
- Structural parameterizations for two bounded degree problems revisited
- Exact and approximate bandwidth
- Structural parameterizations for induced and acyclic matching
- Parallel multiplication and powering of polynomials
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3900988)
