Fast parallel absolute irreducibility testing
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3834091 (Why is no real title available?)
- scientific article; zbMATH DE number 3880854 (Why is no real title available?)
- scientific article; zbMATH DE number 3920595 (Why is no real title available?)
- scientific article; zbMATH DE number 3935166 (Why is no real title available?)
- scientific article; zbMATH DE number 3723860 (Why is no real title available?)
- scientific article; zbMATH DE number 3732172 (Why is no real title available?)
- scientific article; zbMATH DE number 3755863 (Why is no real title available?)
- Equations over finite fields. An elementary approach
- Factoring polynomials with rational coefficients
- Fast parallel matrix and GCD computations
- Parallel computation for well-endowed rings and space-bounded probabilistic machines
- Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
- Towards a complexity theory of synchronous parallel computation
Cited in
(35)- Factoring Rational Polynomials over the Complex Numbers
- Comments on \textit{Integration of algebraic functions}
- Specified precision polynomial root isolation is in NC
- Counting curves and their projections
- Absolute irreducibility of polynomials via Newton polytopes
- Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth theorem
- A study of approximate polynomials. I: Representation and arithmetic
- Deterministic distinct-degree factorization of polynomials over finite fields
- Selected Areas in Cryptography
- Fast Detection of Stable and Count Predicates in Parallel Computations
- Semi-numerical absolute factorization of polynomials with integer coefficients
- Modular Las Vegas algorithms for polynomial absolute factorization
- On a generalization of Stickelberger's theorem
- New absolute irreducibility testing criteria and factorization of multivariate polynomials
- Parallel methods for absolute irreducibility testing
- Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time
- Control of the non-geometrically integral reductions
- Rational solutions of Riccati-like partial differential equations
- Values of polynomials over finite fields
- Probabilistic absolute irreducibility test for polynomials
- A unified method for multivariate polynomial factorizations
- Irreducibility of polynomials modulo \(p\) via Newton polytopes.
- Approximate factorization of multivariate polynomials using singular value decomposition
- Computing the irreducible real factors and components of an algebraic curve
- Lifting and recombination techniques for absolute factorization
- Computational complexity of sentences over fields
- Approximate factorization of multivariate polynomials and absolute irreducibility testing
- On computing the intersection of a pair of algebraic surfaces
- Deterministic irreducibility testing of polynomials over large finite fields
- Improved dense multivariate polynomial factorization algorithms
- Effective Noether irreducibility forms and applications
- Sentences over integral domains and their computational complexities
- Irreducibility of multivariate polynomials
- The Computational Complexity of the Resolution of Plane Curve Singularities
- The computational complexity of recognizing permutation functions
This page was built for publication: Fast parallel absolute irreducibility testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1080657)
