1399 search results - page 9 / 280 » Multi-party Finite Computations |
CIE
2008
Springer
13 years 11 months ago
2008
Springer
A computable graph is computably categorical if any two computable presentations of the graph are computably isomorphic. In this paper we investigate the class of computably catego...
IEEECGIV
2008
IEEE
14 years 4 months ago
2008
IEEE
The focus of this paper is to design a spur gear using an S-shaped transition curve where certain conditions need to be fulfilled such as curvature continuity, shaped parameter etc...
LFP
1992
13 years 11 months ago
1992
We propose a syntactic approach to performing fixed point computation on finite domains. Finding fixed points in finite domains for monotonic functions is an essential task when c...
MOC
2000
13 years 9 months ago
2000
We describe an adaptation of the number field sieve to the problem of computing logarithms in a finite field. We conjecture that the running time of the algorithm, when restricted ...
CCA
2005
Springer
13 years 11 months ago
2005
Springer
If one wishes to find out whether a computational problem over discrete data is solvable or how complex it is, the classical approach is to represent the discrete objects in quest...