Pages that link to "Item:Q1186518"
From MaRDI portal
The following pages link to On fast multiplication of polynomials over arbitrary algebras (Q1186518):
Displaying 50 items.
- On the complexity of skew arithmetic (Q260085) (← links)
- Deterministic root finding over finite fields using Graeffe transforms (Q300881) (← links)
- Complexity of computation in finite fields (Q378003) (← links)
- Complexity bounds for the rational Newton-Puiseux algorithm over finite fields (Q429752) (← links)
- Relaxed algorithms for \(p\)-adic numbers (Q449711) (← links)
- Relaxed Hensel lifting of triangular sets (Q480691) (← links)
- Efficient computation of the characteristic polynomial of a threshold graph (Q507427) (← links)
- Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation (Q540327) (← links)
- Chunky and equal-spaced polynomial multiplication (Q540329) (← links)
- Detecting lacunary perfect powers and computing their roots (Q650838) (← links)
- Homotopy techniques for multiplication modulo triangular sets (Q651881) (← links)
- On the complexities of multipoint evaluation and interpolation (Q706626) (← links)
- Modular composition via factorization (Q722764) (← links)
- Functional decomposition of polynomials: the tame case (Q753496) (← links)
- Polynomial-division-based algorithms for computing linear recurrence relations (Q820938) (← links)
- Solving structured linear systems with large displacement rank (Q954988) (← links)
- Newton's method and FFT trading (Q979146) (← links)
- Fast arithmetic for triangular sets: from theory to practice (Q1025397) (← links)
- Interpolation of polynomials given by straight-line programs (Q1029336) (← links)
- Fast conversion algorithms for orthogonal polynomials (Q1044602) (← links)
- Hardness results and spectral techniques for combinatorial problems on circulant graphs (Q1124798) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- Smoothness and factoring polynomials over finite fields (Q1178194) (← links)
- Algebraic improvements of numerical algorithms: Interpolation and economization of Taylor series (Q1334738) (← links)
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields (Q1365930) (← links)
- Algorithms for exponentiation in finite fields (Q1581128) (← links)
- On the complexity of integer matrix multiplication (Q1635268) (← links)
- Factoring polynomials of the form \(f(x^n) \in \mathbb{F}_q [x]\) (Q1679708) (← links)
- On the complexity of the Lickteig-Roy subresultant algorithm (Q1757020) (← links)
- Computing the bound of an Ore polynomial. Applications to factorization (Q1757021) (← links)
- Essentially optimal computation of the inverse of generic polynomial matrices (Q1763425) (← links)
- A note on the multiple-recursive matrix method for generating pseudorandom vectors (Q1786872) (← links)
- Relax, but don't be too lazy (Q1866999) (← links)
- Multi-point evaluation in higher dimensions (Q1938507) (← links)
- Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation (Q1950387) (← links)
- New techniques for the computation of linear recurrence coefficients (Q1971066) (← links)
- Superfast algorithms for Cauchy-like matrix computations and extensions (Q1978119) (← links)
- Verification protocols with sub-linear communication for polynomial matrix operations (Q1994891) (← links)
- Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields (Q1994892) (← links)
- From implicit to recursive equations (Q2002150) (← links)
- An in-place truncated Fourier transform (Q2066950) (← links)
- Guessing Gröbner bases of structured ideals of relations of sequences (Q2066951) (← links)
- Computing Puiseux series: a fast divide and conquer algorithm (Q2077183) (← links)
- Amortized multi-point evaluation of multivariate polynomials (Q2099269) (← links)
- Polynomial modular product verification and its implications (Q2100047) (← links)
- On the effect of projection on rank attacks in multivariate cryptography (Q2118528) (← links)
- Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields (Q2167518) (← links)
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings (Q2175924) (← links)
- Normal bases from 1-dimensional algebraic groups (Q2188980) (← links)
- Directed evaluation (Q2192677) (← links)