The following pages link to (Q3900988):
Displayed 12 items.
- Impact of Intel's new instruction sets on software implementation of \(GF(2)[x]\) multiplication (Q436584) (← links)
- An alternative class of irreducible polynomials for optimal extension fields (Q543428) (← links)
- Exact and approximate bandwidth (Q708223) (← links)
- Parallel multiplication and powering of polynomials (Q808710) (← links)
- Computing the determinant of a matrix with polynomial entries by approximation (Q1621164) (← links)
- Counting solutions to CSP using generating polynomials (Q2447541) (← links)
- A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers (Q2512883) (← links)
- Gerrymandering on graphs: computational complexity and parameterized algorithms (Q2670918) (← links)
- When NTT meets Karatsuba: preprocess-then-NTT technique revisited (Q2672460) (← links)
- All secant varieties of the Chow variety are nondefective for cubics and quaternary forms (Q4992375) (← links)
- Even more effort towards improved bounds and fixed-parameter tractability for multiwinner rules (Q6066767) (← links)
- More effort towards multiagent knapsack (Q6169510) (← links)