Computer Science – Symbolic Computation
Scientific paper
2010-01-29
Computer Science
Symbolic Computation
7 pages. Submitted to ISSAC 2010
Scientific paper
We observe that the vocabulary used to construct the "answer" to problems in computer algebra can have a dramatic effect on the computational complexity of solving that problem. We recall a formalization of this observation and explain the classic example of sparse polynomial arithmetic. For this case, we show that it is possible to extend the vocabulary so as reap the benefits of conciseness whilst avoiding the obvious pitfall of repeating the problem statement as the "solution". It is possible to extend the vocabulary either by irreducible cyclotomics or by $x^n-1$: we look at the options and suggest that the pragmatist might opt for both.
Carette Jacques
Davenport James H.
No associations
LandOfFree
The Power of Vocabulary: The Case of Cyclotomic Polynomials does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Power of Vocabulary: The Case of Cyclotomic Polynomials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Power of Vocabulary: The Case of Cyclotomic Polynomials will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-251215