Pages that link to "Item:Q5235106"
From MaRDI portal
The following pages link to Randomized polynomial-time root counting in prime power rings (Q5235106):
Displaying 8 items.
- \#P-completeness of counting roots of a sparse polynomial (Q1628696) (← links)
- Noisy polynomial interpolation modulo prime powers (Q2034569) (← links)
- Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields (Q2167518) (← links)
- On the coefficient-choosing game (Q2235355) (← links)
- Counting and Testing Dominant Polynomials (Q2813821) (← links)
- (Q5091766) (← links)
- Solving polynomial systems over non-fields and applications to modular polynomial factoring (Q6543078) (← links)
- A complexity chasm for solving univariate sparse polynomial equations over \(p\)-adic fields (Q6666555) (← links)