The following pages link to (Q5550483):
Displaying 50 items.
- Deterministic root finding over finite fields using Graeffe transforms (Q300881) (← links)
- Is every matrix similar to a polynomial in a companion matrix? (Q445817) (← links)
- A pre-test for factoring bivariate polynomials with coefficients in \(\mathbb F_2\) (Q509886) (← links)
- A note on Gao's algorithm for polynomial factorization (Q633632) (← links)
- Macsyma: A personal history (Q655565) (← links)
- New recombination algorithms for bivariate polynomial factorization based on Hensel lifting (Q964741) (← links)
- Iterative root approximation in \(p\)-adic numerical analysis (Q1049397) (← links)
- MACSYMA from F to G (Q1062750) (← links)
- Factoring sparse multivariate polynomials (Q1080656) (← links)
- An application of factoring (Q1081302) (← links)
- Irreducibility of multivariate polynomials (Q1083191) (← links)
- Factoring polynomials and primitive elements for special primes (Q1095971) (← links)
- Computer algebra: Past and future (Q1098287) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- A cryptographic system based on finite field transforms (Q1144545) (← links)
- A heuristic irreducibility test for univariate polynomials (Q1186702) (← links)
- A new approach to the symbolic factorization of multivariate polynomials (Q1228373) (← links)
- \(\sqrt{2}+\sqrt{3}\): Four different views (Q1284617) (← links)
- Connections between the algorithms of Berlekamp and Niederreiter for factoring polynomials over \(\mathbb{F}_ q\) (Q1311315) (← links)
- Factorization of polynomials and some linear-algebra problems over finite fields (Q1311328) (← links)
- Finding maximal orders in semisimple algebras over \(\mathbb{Q}\) (Q1312180) (← links)
- Factoring polynomials over arbitrary finite fields (Q1575686) (← links)
- Explicit equivalence of quadratic forms over \(\mathbb{F}_q(t)\) (Q1633281) (← links)
- Extremal quasi-cyclic self-dual codes over finite fields (Q1637204) (← links)
- Computing explicit isomorphisms with full matrix algebras over \(\mathbb {F}_q(x)\) (Q1750386) (← links)
- Characterization and enumeration of good punctured polynomials over finite fields (Q1751477) (← links)
- Polynomial factorization over finite fields by computing Euler-Poincaré characteristics of Drinfeld modules (Q1800711) (← links)
- The decomposition theorem for ideals in polynomial rings over a domain (Q1835957) (← links)
- Subspaces and polynomial factorizations over finite fields (Q1842604) (← links)
- A conversion algorithm for logarithms on \(GF(2^n)\) (Q1844260) (← links)
- An application of algebraic geometry to encryption: tame transformation method (Q1884054) (← links)
- A verified implementation of the Berlekamp-Zassenhaus factorization algorithm (Q1984794) (← links)
- Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields (Q1994892) (← links)
- Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes (Q2000290) (← links)
- Computation of orders and cycle lengths of automorphisms of finite solvable groups (Q2048160) (← links)
- Efficiently factoring polynomials modulo \(p^4\) (Q2229745) (← links)
- A new efficient factorization algorithm for polynomials over small finite fields (Q2366271) (← links)
- Splitting quaternion algebras over quadratic number fields (Q2422710) (← links)
- Improving the algorithms of Berlekamp and Niederreiter for factoring polynomials over finite fields (Q2457415) (← links)
- A note on Gröbner bases and Berlekamp's algorithm (Q2474859) (← links)
- Theory of computational complexity. Part 9. Transl. from the Russian. (Q2494566) (← links)
- On the factorization of polynomials (Q2532171) (← links)
- On Hensel factorization. I (Q2537316) (← links)
- Substitutions for linear shift register sequences and the factorization algorithms of Berlekamp and Niederreiter (Q2564910) (← links)
- Bounded-degree factors of lacunary multivariate polynomials (Q2635075) (← links)
- Algebraic Cryptanalysis of Yasuda, Takagi and Sakurai’s Signature Scheme (Q2942826) (← links)
- Cryptographic Applications of Capacity Theory: On the Optimality of Coppersmith’s Method for Univariate Polynomials (Q2958146) (← links)
- Primary decomposition of zero-dimensional ideals over finite fields (Q3055105) (← links)
- Trading GRH for algebra: Algorithms for factoring polynomials and related structures (Q3117221) (← links)
- Polynomial factorization over ${\mathbb F}_2$ (Q3147181) (← links)
