Computing sparse multiples of polynomials
From MaRDI portal
Publication:1934308
DOI10.1007/s00453-012-9652-4zbMath1282.68198OpenAlexW2019463665MaRDI QIDQ1934308
Daniel S. Roche, Hrushikesh Tilak, Mark W. Giesbrecht
Publication date: 28 January 2013
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-012-9652-4
Symbolic computation and algebraic computation (68W30) Polynomials, factorization in commutative rings (13P05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factoring polynomials with rational coefficients
- Sparsification of rectangular matrices
- Approximate formulas for some functions of prime numbers
- Computing Sparse Multiples of Polynomials
- Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard
- $\mathcal{TCH}o$ : A Hardware-Oriented Trapdoor Cipher
- A Practical Key Recovery Attack on Basic TCHo
- Searching for Primitive Roots in Finite Fields
- On the Order and Degree of Solutions to Pure Equations
- On the inherent intractability of certain coding problems (Corresp.)
- The intractability of computing the minimum distance of a code
- Algorithms for Finding Almost Irreducible and Almost Primitive Trinomials
- Groups, Factoring, and Cryptography
- A sieve algorithm for the shortest lattice vector problem
This page was built for publication: Computing sparse multiples of polynomials
