2853 search results - page 238 / 571 » On Coherence in Computer Algebra |
107
click to vote
SODA
1990
ACM
15 years 6 months ago
1990
ACM
Let O be an order of an algebraic number field. It was shown by Ge that given a factorization of an O-ideal a into a product of O-ideals it is possible to compute in polynomial tim...
123
click to vote
AMC
2008
15 years 5 months ago
2008
This paper discusses the infinite horizon stochastic Nash games with state-dependent noise. After establishing the asymptotic structure along with the positive semidefiniteness for...
133
Voted
IIE
2006
15 years 5 months ago
2006
Abstract. The scope of the paper is animation facilities of computer algebra systems (CAS). Animation offers opportunities for visualization of complex mathematical concepts, provi...
162
Voted
JSC
2011
14 years 8 months ago
2011
In 1974, Johnson showed how to multiply and divide sparse polynomials using a binary heap. This paper introduces a new algorithm that uses a heap to divide with the same complexit...
218
click to vote
CASC
2011
Springer
14 years 5 months ago
2011
Springer
We investigate two practical divide-and-conquer style algorithms for univariate polynomial arithmetic. First we revisit an algorithm originally described by Brent and Kung for comp...