A normal form for function rings of piecewise functions
Journal of Symbolic Computation
Algorithms for trigonometric polynomials
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
The computational complexity of algebraic numbers
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Symbolic computation of multidimensional Fenchel conjugates
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Symbolic computation of Fenchel conjugates
ACM Communications in Computer Algebra
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Reasoning with Generic Cases in the Arithmetic of Abstract Matrices
Calculemus '09/MKM '09 Proceedings of the 16th Symposium, 8th International Conference. Held as Part of CICM '09 on Intelligent Computer Mathematics
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Simplifying products of fractional powers of powers
ACM Communications in Computer Algebra
| Hi-index | 0.00 |
We define a canonical form for piecewise defined functions. We show that the domains and ranges for which these functions are defined is larger than in previous work. Also, our canonical form algorithm is linear in the number of breakpoints instead of exponential. These results rely on the linear structure of the underlying domain of definition.