Pages that link to "Item:Q1202761"
From MaRDI portal
The following pages link to Analysis of approximate factorization algorithm. I (Q1202761):
Displaying 11 items.
- Sparse bivariate polynomial factorization (Q477285) (← links)
- Computing monodromy via continuation methods on random Riemann surfaces (Q633630) (← links)
- A unified method for multivariate polynomial factorizations (Q689904) (← links)
- A study of approximate polynomials. I: Representation and arithmetic (Q1895002) (← links)
- Obtaining exact interpolation multivariate polynomial by approximation (Q1937782) (← links)
- Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots (Q2341619) (← links)
- Obtaining exact value by approximate computations (Q2464301) (← links)
- Approximate factorization of multivariate polynomials using singular value decomposition (Q2482630) (← links)
- Sharp precision in Hensel lifting for bivariate polynomial factorization (Q3377003) (← links)
- Regularization and Matrix Computation in Numerical Polynomial Algebra (Q3576574) (← links)
- The integer Chebyshev problem (Q4878573) (← links)
