The following pages link to (Q4279514):
Displaying 10 items.
- A local decision test for sparse polynomials (Q407596) (← links)
- A Wronskian approach to the real \(\tau\)-conjecture (Q480686) (← links)
- Testing the shift-equivalence of polynomials using quantum machines (Q1356318) (← links)
- Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines. (Q1390870) (← links)
- Zero testing of \(p\)-adic and modular polynomials (Q1575936) (← links)
- Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases (Q1878479) (← links)
- Sparse shifts for univariate polynomials (Q1924546) (← links)
- Computing the multilinear factors of lacunary polynomials without heights (Q2229711) (← links)
- An algorithm for deciding the summability of bivariate rational functions (Q2254998) (← links)
- Reconstruction algorithms for sums of affine powers (Q2284961) (← links)
