Pages that link to "Item:Q4729880"
From MaRDI portal
The following pages link to A geometric approach to root finding in GT(q/sup m/) (Q4729880):
Displaying 11 items.
- Characterization for a family of infinitely many irreducible equally spaced polynomials (Q750156) (← links)
- Guest editorial: Special issue in honor of Scott A. Vanstone (Q887413) (← links)
- On splitting sets in block designs and finding roots of polynomials (Q915734) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- Optimal and pessimal orderings of Steiner triple systems in disk arrays. (Q1401294) (← links)
- Ladder orderings of pairs and RAID performance. (Q1428550) (← links)
- A case study for constrained learning neural root finders (Q1780526) (← links)
- Dilation method for finding close roots of polynomials based on constrained learning neural networks (Q1865473) (← links)
- Finding roots in with the successive resultants algorithm (Q2878836) (← links)
- Deterministic root finding in finite fields (Q5270175) (← links)
- Factoring polynomials over finite fields: A survey (Q5928877) (← links)
