Factoring sparse polynomials fast
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3856407 (Why is no real title available?)
- scientific article; zbMATH DE number 3977110 (Why is no real title available?)
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 3757697 (Why is no real title available?)
- scientific article; zbMATH DE number 3785035 (Why is no real title available?)
- scientific article; zbMATH DE number 66619 (Why is no real title available?)
- scientific article; zbMATH DE number 1305293 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- scientific article; zbMATH DE number 2151179 (Why is no real title available?)
- scientific article; zbMATH DE number 3265895 (Why is no real title available?)
- A New Algorithm for Factoring Polynomials Over Finite Fields
- A fast parallel sparse polynomial GCD algorithm
- A sparse modular GCD algorithm for polynomials over algebraic function fields
- A unified method for multivariate polynomial factorizations
- An Improved Multivariate Polynomial Factoring Algorithm
- An LLL-reduction algorithm with quasi-linear time complexity, extended abstract
- Basic algebraic geometry 1. Varieties in projective space. Translated from the Russian by Miles Reid
- Bounded-degree factors of lacunary multivariate polynomials
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
- Conquering inseparability: primary decomposition and multivariate factorization over algebraic function fields of positive characteristic
- Directed evaluation
- Diversification improves interpolation
- Effective Noether irreducibility forms and applications
- Effective procedures in field theory
- Evaluating Polynomials at Fixed Sets of Points
- Factoring Multivariate Polynomials Over the Integers
- Factoring Polynomials Over Large Finite Fields
- Factoring multivariate polynomials represented by black boxes: a Maple + C implementation
- Factoring multivariate polynomials via partial differential equations
- Factoring multivariate polynomials with many factors and huge coefficients
- Factoring polynomials and the knapsack problem
- Factoring polynomials over global fields
- Factoring polynomials via polytopes
- Factoring polynomials with rational coefficients
- Factoring sparse multivariate polynomials
- Factorization of Multivariate Polynomials Over Finite Fields
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Fast interpolation of multivariate polynomials with sparse exponents
- Fast modular transforms
- Fast multivariate multi-point evaluation revisited
- Fast polynomial factorization and modular composition
- Fast practical lattice reduction through iterated compression
- Fast separable factorization and applications
- Improved dense multivariate polynomial factorization algorithms
- Introduzione alla geometria projettiva degli iperspazi con appendice sulle curve algebriche e loro singolarità. Seconda edizione riveduta ed ampliata.
- Irreducibility and greatest common divisor algorithms for sparse polynomials
- Irreducibility of multivariate polynomials
- Lifting and recombination techniques for absolute factorization
- Modern computer algebra
- Multivariate Polynomial Factorization
- New NP-hard and NP-complete polynomial and integer divisibility problems
- New data structure for univariate polynomial approximation and applications to root isolation, numerical multipoint evaluation, and other problems
- New foundations of arithmetic.
- New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
- Newton polygons of higher order in algebraic number theory
- On Hensel factorization. I
- On fast multiplication of polynomials over arbitrary algebras
- On sparse interpolation of rational functions and gcds
- On the bit-complexity of sparse polynomial and series multiplication
- On the complexity of the Lickteig-Roy subresultant algorithm
- On the deterministic complexity of factoring polynomials over finite fields
- On the factorization of polynomials in a finite number of steps
- Plane curve germs and contact factorization
- Polynomial evaluation and interpolation on special sets of points
- Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
- Randomized root finding over finite FFT-fields using tangent Graeffe transforms
- Reduzibilität ebener Kurven.
- Sharp precision in Hensel lifting for bivariate polynomial factorization
- Sparse bivariate polynomial factorization
- Sparse complex polynomials and polynomial reducibility
- Sparse interpolation of multivariate rational functions
- Sparse multivariate Hensel lifting: a high-performance design and implementation
- Sparse polynomial interpolation and division in soft-linear time
- Sparse polynomial interpolation over fields with large or zero characteristic
- Sparse polynomial interpolation: faster strategies over finite fields
- Square-free algorithms in positive characteristic
- Subquadratic-time factoring of polynomials over finite fields
- Subresultants and Reduced Polynomial Remainder Sequences
- The complexity and parallel implementation of two sparse multivariate Hensel lifting algorithms for polynomial factorization
- The complexity of sparse Hensel lifting and sparse polynomial factorization
- Univariate polynomial factorization over finite fields with large extension degree
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- Using sparse interpolation in Hensel lifting
- Von denjenigen Moduln, welche Potenzen von Primzahlen sind.(Fortsetzung)
- What can (and can't) we do with sparse polynomials?
- Über die Irreducibilität ganzer rationaler Functionen mit ganzzahligen Coefficienten.
This page was built for publication: Factoring sparse polynomials fast
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7006210)
