An empirical study of cache-oblivious polygon indecomposability testing
DOI10.1007/S00607-010-0086-ZzbMATH Open1204.68238OpenAlexW1988874385MaRDI QIDQ975317FDOQ975317
Authors: Fatima K. Abu Salem, Rawan N. Soudah 
Publication date: 9 June 2010
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-010-0086-z
Recommendations
computer algebraperformance evaluationNewton polytopescache-oblivious algorithmsabsolute irreducibility testingmultivariate and bivariate polynomials
Symbolic computation and algebraic computation (68W30) Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55) Number-theoretic algorithms; complexity (11Y16)
Cites Work
- The Magma algebra system. I: The user language
- Absolute irreducibility of polynomials via Newton polytopes
- Cache-oblivious algorithms
- Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
- Factoring Multivariate Polynomials over Algebraic Number Fields
- Factoring multivariate polynomials via partial differential equations
- Decomposition of polytopes and polynomials
- Factoring multivariate polynomials over finite fields
- An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation
- Absolute Factorization of Polynomials: A Geometric Approach
- Factorization of Multivariate Polynomials Over Finite Fields
- Parallel Processing and Applied Mathematics
Cited In (1)
Uses Software
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)
