5510 search results - page 245 / 1102 » Mathematics |
157
click to vote
ISSAC
2009
Springer
16 years 10 days 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...
156
click to vote
ISSAC
2009
Springer
16 years 10 days 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...
157
click to vote
ISSAC
2009
Springer
16 years 10 days ago
2009
Springer
We present an efficient algorithm for factoring a multivariate polynomial f ∈ L[x1, . . . , xv] where L is an algebraic function field with k ≥ 0 parameters t1, . . . , tk an...
152
click to vote
FASE
2010
Springer
16 years 8 days ago
2010
Springer
Abstract. Abstraction is essential in the formal specification of programs. A common way of writing abstract specifications is to specify implementations in terms of basic mathem...
162
click to vote
GLOBECOM
2008
IEEE
16 years 7 days ago
2008
IEEE
—In this paper, we manage to prove the log-concavity of the generalized Marcum Q-function Qν (a, b) with respect to its order ν on [1, ∞). The proof relies on a powerful math...