Pages that link to "Item:Q1080657"
From MaRDI portal
The following pages link to Fast parallel absolute irreducibility testing (Q1080657):
Displayed 29 items.
- Modular Las Vegas algorithms for polynomial absolute factorization (Q607052) (← links)
- On a generalization of Stickelberger's theorem (Q607067) (← links)
- Counting curves and their projections (Q677992) (← links)
- A unified method for multivariate polynomial factorizations (Q689904) (← links)
- On computing the intersection of a pair of algebraic surfaces (Q913442) (← links)
- Computational complexity of sentences over fields (Q937294) (← links)
- Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth theorem (Q990817) (← links)
- Irreducibility of multivariate polynomials (Q1083191) (← links)
- Approximate factorization of multivariate polynomials and absolute irreducibility testing (Q1179781) (← links)
- Sentences over integral domains and their computational complexities (Q1286369) (← links)
- Specified precision polynomial root isolation is in NC (Q1329153) (← links)
- Irreducibility of polynomials modulo \(p\) via Newton polytopes. (Q1399670) (← links)
- Probabilistic absolute irreducibility test for polynomials (Q1612137) (← links)
- Computing the irreducible real factors and components of an algebraic curve (Q1814128) (← links)
- Deterministic irreducibility testing of polynomials over large finite fields (Q1825030) (← links)
- A study of approximate polynomials. I: Representation and arithmetic (Q1895002) (← links)
- Lifting and recombination techniques for absolute factorization (Q2371310) (← links)
- Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time (Q2431341) (← links)
- Improved dense multivariate polynomial factorization algorithms (Q2457431) (← links)
- Approximate factorization of multivariate polynomials using singular value decomposition (Q2482630) (← links)
- Semi-numerical absolute factorization of polynomials with integer coefficients (Q2643526) (← links)
- Deterministic distinct-degree factorization of polynomials over finite fields (Q2643572) (← links)
- The Computational Complexity of the Resolution of Plane Curve Singularities (Q3203147) (← links)
- Values of polynomials over finite fields (Q3495444) (← links)
- Control of the non-geometrically integral reductions (Q5025437) (← links)
- Comments on Integration of Algebraic Functions (Q5050162) (← links)
- The computational complexity of recognizing permutation functions (Q5917358) (← links)
- Absolute irreducibility of polynomials via Newton polytopes (Q5936184) (← links)
- Rational solutions of Riccati-like partial differential equations (Q5937885) (← links)