The following pages link to Effective Hilbert irreducibility (Q3708878):
Displayed 9 items.
- A pre-test for factoring bivariate polynomials with coefficients in \(\mathbb F_2\) (Q509886) (← 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)
- Latin square determinants II (Q1199479) (← links)
- Sentences over integral domains and their computational complexities (Q1286369) (← links)
- Improved dense multivariate polynomial factorization algorithms (Q2457431) (← links)
- Factoring multivariate polynomials represented by black boxes: a Maple + C implementation (Q2680117) (← links)
- New Sparse Multivariate Polynomial Factorization Algorithms over Integers (Q6060389) (← links)
- On some regularity condition (Q6155551) (← links)