HUC
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. NearMe is a server, algorithms, and application programming interfaces (APIs) for clients equipped with 802.11 wireless networking (Wi-Fi) to compute lists of people and ...
CRYPTO
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
ANTS
2004
Springer
13 years 10 months ago
2004
Springer
We compute all nonic extensions of Q3 and find that there are 795 of them up to isomorphism. We describe how to compute the associated Galois group of such a field, and also the ...
SMA
2006
ACM
13 years 10 months ago
2006
ACM
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
ISSAC
2009
Springer
13 years 11 months ago
2009
Springer
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a functi...
ISSAC
2009
Springer
13 years 11 months ago
2009
Springer
In this paper we report on an experience communicating two computer algebra systems, namely GAP (and more concretely, its HAP package to compute in Homological Algebra) and Kenzo ...