An empirical study of cache-oblivious polygon indecomposability testing

DOI10.1007/s00607-010-0086-zzbMath1204.68238OpenAlexW1988874385MaRDI QIDQ975317

Rawan N. Soudah, Fatima K. Abu Salem

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

zbMATH Keywords

performance evaluationcomputer algebraNewton polytopescache-oblivious algorithmsabsolute irreducibility testingmultivariate and bivariate polynomials

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Number-theoretic algorithms; complexity (11Y16)

Uses Software

• Magma

Cites Work

• Factoring multivariate polynomials over finite fields
• The Magma algebra system. I: The user language
• An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation
• Cache-Oblivious Algorithms
• Absolute Factorization of Polynomials: A Geometric Approach
• Factorization of Multivariate Polynomials Over Finite Fields
• 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
• Parallel Processing and Applied Mathematics
• Absolute irreducibility of polynomials via Newton polytopes
• Decomposition of polytopes and polynomials

This page was built for publication: An empirical study of cache-oblivious polygon indecomposability testing