Pages that link to "Item:Q3743372"

The following pages link to Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization (Q3743372):

Displaying 42 items.

• Factors of low individual degree polynomials (Q301529) (← links)
• Sparse bivariate polynomial factorization (Q477285) (← links)
• Random arithmetic formulas can be reconstructed efficiently (Q488050) (← links)
• A pre-test for factoring bivariate polynomials with coefficients in \(\mathbb F_2\) (Q509886) (← links)
• The numerical factorization of polynomials (Q525605) (← links)
• Deformation techniques to solve generalised Pham systems (Q598226) (← links)
• A note on Gao's algorithm for polynomial factorization (Q633632) (← links)
• Complexity of factoring and calculating the GCD of linear ordinary differential operators (Q805235) (← links)
• Algorithms for near solutions to polynomial equations (Q840709) (← links)
• Factoring bivariate sparse (lacunary) polynomials (Q883330) (← links)
• On computing the intersection of a pair of algebraic surfaces (Q913442) (← links)
• Interpolating polynomials from their values (Q915342) (← links)
• Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators (Q923629) (← links)
• Computational complexity of sentences over fields (Q937294) (← links)
• An empirical study of cache-oblivious polygon indecomposability testing (Q975317) (← links)
• Parallel methods for absolute irreducibility testing (Q1009361) (← links)
• Factoring sparse multivariate polynomials (Q1080656) (← links)
• Fast parallel absolute irreducibility testing (Q1080657) (← links)
• Irreducibility of multivariate polynomials (Q1083191) (← links)
• Computer algebra: Past and future (Q1098287) (← links)
• Sentences over integral domains and their computational complexities (Q1286369) (← links)
• Approximate solutions of polynomial equations. (Q1599546) (← 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)
• Computing a context-free grammar-generating series (Q1854451) (← links)
• Efficient \(q\)-integer linear decomposition of multivariate polynomials (Q2029008) (← links)
• Heuristics to sift extraneous factors in Dixon resultants (Q2117431) (← links)
• Computation of étale cohomology on curves in single exponential time (Q2211019) (← links)
• Time-bounded termination analysis for probabilistic programs with delays (Q2216132) (← links)
• Computing the multilinear factors of lacunary polynomials without heights (Q2229711) (← links)
• Complexity of solving parametric polynomial systems (Q2256707) (← links)
• A conflict-driven solving procedure for poly-power constraints (Q2303230) (← links)
• Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\) (Q2399868) (← 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)
• An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation (Q2482628) (← links)
• Deterministic distinct-degree factorization of polynomials over finite fields (Q2643572) (← links)
• Efficient algorithms for computing rational first integrals and Darboux polynomials of planar polynomial vector fields (Q2792368) (← links)
• Factoring multivariate polynomials via partial differential equations (Q4794644) (← links)
• (Q5009633) (← links)
• Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring (Q5889792) (← links)
• Rational solutions of Riccati-like partial differential equations (Q5937885) (← links)