102291 search results - page 15 / 20459 » Computing |
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
We present upper bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is no more powerful than sequential space, thus gi...
EUROMICRO
1997
IEEE
13 years 12 months ago
1997
IEEE
This paper considers whether the seemingly disparate fields of Computational Intelligence (CI) and computer architecture can profit from each others’ principles, results and e...
APAL
2005
13 years 7 months ago
2005
Abstract. We construct a computable vector space with the trivial computable automorphism group, but with the dependence relations as complicated as possible, measured by their Tur...
PAIRING
2010
Springer
13 years 5 months ago
2010
Springer
Scott uses an efficiently computable isomorphism in order to optimize pairing computation on a particular class of curves with embedding degree 2. He points out that pairing implem...
UC
2009
Springer
14 years 2 months ago
2009
Springer
Geometrical Computation and Computable Analysis J´erˆome Durand-Lose⋆ Laboratoire d’Informatique Fondamentale d’Orl´eans, Universit´e d’Orl´eans, B.P. 6759, F-45067 OR...