3618 search results - page 6 / 724 » Additive functions for number systems in function fields |
SIAMCOMP
2008
13 years 7 months ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
FFA
2011
13 years 2 months ago
2011
ABSTRACT. We prove the rationality of the generating function associated to the number of equivalence classes of Fqk -points of a constructible equivalence relation defined over t...
AML
2008
13 years 7 months ago
2008
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether def...
ARITH
2005
IEEE
14 years 1 months ago
2005
IEEE
— The Residue Logarithmic Number System (RLNS) represents real values as quantized logarithms which, in turn, are represented using the Residue Number System (RNS). Compared to t...
ARITH
2003
IEEE
14 years 23 days ago
2003
IEEE
This paper introduces a method for extracting the core of a Residue Number System (RNS) number within the RNS, this affording a new method for scaling RNS numbers. Suppose an RNS ...