Pages that link to "Item:Q3775638"
From MaRDI portal
The following pages link to Factoring Multivariate Polynomials over Algebraic Number Fields (Q3775638):
Displayed 16 items.
- Optimal algorithm for algebraic factoring (Q676848) (← links)
- Algorithms for near solutions to polynomial equations (Q840709) (← links)
- Factoring bivariate sparse (lacunary) polynomials (Q883330) (← 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)
- Polynomial time algorithms for sentences over number fields (Q1187032) (← links)
- On interpolating arithmetic read-once formulas with exponentiation (Q1267719) (← links)
- Sentences over integral domains and their computational complexities (Q1286369) (← links)
- Skolem functions of arithmetical sentences. (Q1427862) (← links)
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey (Q1581129) (← links)
- Approximate solutions of polynomial equations. (Q1599546) (← links)
- Decomposing algebraic sets using Gröbner bases (Q1823621) (← links)
- An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation (Q2482628) (← links)
- Algorithms in Algebraic Number Theory (Q4005808) (← links)
- Factoring multivariate polynomials via partial differential equations (Q4794644) (← links)