The following pages link to (Q3668871):
Displaying 23 items.
- An efficient algorithm for factoring polynomials over algebraic extension field (Q365855) (← links)
- Factoring polynomials and the knapsack problem (Q701105) (← links)
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators (Q923629) (← links)
- New recombination algorithms for bivariate polynomial factorization based on Hensel lifting (Q964741) (← links)
- A hierarchy of generalized invariants for linear partial differential operators (Q1047954) (← links)
- Fast Hensel's lifting implementation using partial fraction decomposition (Q1074651) (← links)
- Some examples for solving systems of algebraic equations by calculating Gröbner bases (Q1082037) (← links)
- Application of the MuMATH(R) symbol manipulation system to chemically significant permutation groups (Q1084861) (← links)
- Computer algebra: Past and future (Q1098287) (← links)
- An improved projection operation for cylindrical algebraic decomposition of three-dimensional space (Q1105370) (← links)
- An adjacency algorithm for cylindrical algebraic decompositions of three- dimensional space (Q1105371) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- Approximate GCD and its application to ill-conditioned algebraic equations (Q1184132) (← links)
- Implicit representation of rational parametric surfaces (Q1198242) (← links)
- Factoring multivariate integral polynomials (Q1348530) (← links)
- Validity proof of Lazard's method for CAD construction (Q1757004) (← links)
- Testing polynomials for vanishing on Cartesian products of planar point sets: collinearity testing and related problems (Q2105319) (← links)
- Complexity of solving parametric polynomial systems (Q2256707) (← links)
- Fast separable factorization and applications (Q2426955) (← links)
- Improved dense multivariate polynomial factorization algorithms (Q2457431) (← links)
- Theory of computational complexity. Part 9. Transl. from the Russian. (Q2494566) (← links)
- Factoring polynomials over finite fields: A survey (Q5928877) (← links)
- Using the interval-symbol method with zero rewriting to factor polynomials over algebraic number fields (Q6536542) (← links)
