The following pages link to (Q3326837):
Displaying 28 items.
- Is every matrix similar to a polynomial in a companion matrix? (Q445817) (← links)
- The computation of polynomial greatest common divisors over an algebraic number field (Q582076) (← links)
- Computing primitive elements of extension fields (Q911775) (← links)
- Factoring sparse multivariate polynomials (Q1080656) (← links)
- Irreducibility of multivariate polynomials (Q1083191) (← links)
- Computer algebra: Past and future (Q1098287) (← links)
- On the normalization of numbers and functions defined by radicals (Q1394941) (← links)
- Hilbert subsets and \(s\)-integral points (Q1910157) (← links)
- Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes (Q2000290) (← links)
- Computing groups of Hecke characters (Q2093681) (← links)
- Kummer theory for number fields via entanglement groups (Q2162770) (← links)
- List decoding of number field codes (Q2249795) (← links)
- A note on locality of algebras (Q2343500) (← links)
- Roots of unity in orders (Q2362292) (← links)
- Factoring polynomials over global fields. II. (Q2456609) (← links)
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding (Q2516785) (← links)
- Bounded-degree factors of lacunary multivariate polynomials (Q2635075) (← links)
- Inversion in finite fields using logarithmic depth (Q2638778) (← links)
- Algorithms in Algebraic Number Theory (Q4005808) (← links)
- A Polynomial Time Complexity Bound for Computations on Curves (Q4210172) (← links)
- Factoring multivariate polynomials via partial differential equations (Q4794644) (← links)
- A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function (Q4955867) (← links)
- Irreducibility testing over local fields (Q4955868) (← links)
- Computation of lattice isomorphisms and the integral matrix similarity problem (Q5041469) (← links)
- -adic images of Galois for elliptic curves over (and an appendix with John Voight) (Q5101299) (← links)
- Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring (Q5889792) (← links)
- Kronecker's and Newton's approaches to solving: a first comparison (Q5938585) (← links)
- Norm relations and computational problems in number fields (Q6175935) (← links)
