2853 search results - page 385 / 571 » On Coherence in Computer Algebra |
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also...
86
Voted
ISSAC
2009
Springer
15 years 4 months ago
2009
Springer
We present a high performance algorithm for multiplying sparse distributed polynomials using a multicore processor. Each core uses a heap of pointers to multiply parts of the poly...
85
Voted
ISSAC
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we present an improved method for decomposing multivariate polynomials. This problem, also known as the Functional Decomposition Problem (FDP) [17, 9, 27], is class...
90
Voted
MKM
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Recent work has detailed the conditions under which univariate Laurent polynomials have functional decompositions. This paper presents algorithms to compute such univaria...
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
— We consider the problem of designing optimal distributed controllers whose impulse response has limited propagation speed. We introduce a state-space framework in which such co...