The following pages link to (Q3912021):
Displayed 17 items.
- On a generalization of Stickelberger's theorem (Q607067) (← links)
- A unified method for multivariate polynomial factorizations (Q689904) (← links)
- Definability and fast quantifier elimination in algebraically closed fields (Q798314) (← links)
- Interpolating polynomials from their values (Q915342) (← links)
- Computational complexity of sentences over fields (Q937294) (← links)
- Fast parallel absolute irreducibility testing (Q1080657) (← 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)
- An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs (Q1295548) (← links)
- Straight-line programs in geometric elimination theory (Q1380007) (← links)
- Complexity bounds in elimination theory -- a survey. (Q1565824) (← links)
- Probabilistic absolute irreducibility test for polynomials (Q1612137) (← links)
- Randomised algorithms (Q1836980) (← links)
- Functional programming concepts and straight-line programs in computer algebra (Q1849848) (← links)
- Lifting and recombination techniques for absolute factorization (Q2371310) (← links)
- Improved dense multivariate polynomial factorization algorithms (Q2457431) (← links)