12289 search results - page 169 / 2458 » computing 2006 |
105
click to vote
DAGSTUHL
2006
15 years 4 months ago
2006
In this paper we consider a number of challenges from the point of view of the CoCoA project one of whose tasks is to develop software specialized for computations in commutative a...
JSC
2006
15 years 3 months ago
2006
For a polynomial ring R = k[x1, ..., xn], we present a method to compute the characteristic cycle of the localization Rf for any nonzero polynomial f R that avoids a direct comput...
110
click to vote
LOGCOM
2010
15 years 1 months ago
2010
In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in ...
76
Voted
DCC
2006
IEEE
16 years 2 months ago
2006
IEEE
We present an algorithm to compute r-th roots in Fqm with complexity O((log m + r log q)m2 log2 q) for certain choices of m and q. This compares well to previously known algorithms...
115
click to vote
JOC
2006
15 years 3 months ago
2006
We study the role of connectivity of communication networks in private computations under information theoretic settings. It will be shown that some functions can be computed by pr...