An empirical study of cache-oblivious polygon indecomposability testing
From MaRDI portal
(Redirected from Publication:975317)
Recommendations
Cites work
- Absolute Factorization of Polynomials: A Geometric Approach
- Absolute irreducibility of polynomials via Newton polytopes
- An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation
- Cache-oblivious algorithms
- Decomposition of polytopes and polynomials
- Factoring Multivariate Polynomials over Algebraic Number Fields
- Factoring multivariate polynomials over finite fields
- Factoring multivariate polynomials via partial differential equations
- Factorization of Multivariate Polynomials Over Finite Fields
- Parallel Processing and Applied Mathematics
- Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
- The Magma algebra system. I: The user language
This page was built for publication: An empirical study of cache-oblivious polygon indecomposability testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975317)