Fast Arithmetical Algorithms in Mobius Number Systems
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11620%2F12%3A10124105" target="_blank" >RIV/00216208:11620/12:10124105 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1109/TC.2012.87" target="_blank" >http://dx.doi.org/10.1109/TC.2012.87</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/TC.2012.87" target="_blank" >10.1109/TC.2012.87</a>
Alternative languages
Result language
angličtina
Original language name
Fast Arithmetical Algorithms in Mobius Number Systems
Original language description
We analyze the time complexity of exact real arithmetical algorithms in Mobius number systems. Using the methods of Ergodic theory, we associate to any Mobius number system its transaction quotient and show that the norm of the state matrix is linear inthe number of transactions. We show that our Bimodular number system computes some arithmetical operations faster than any standard positional system.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA201%2F09%2F0854" target="_blank" >GA201/09/0854: Dynamics of Iterative Systems</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
IEEE TRANSACTIONS ON COMPUTERS
ISSN
0018-9340
e-ISSN
—
Volume of the periodical
61
Issue of the periodical within the volume
8
Country of publishing house
US - UNITED STATES
Number of pages
13
Pages from-to
1097-1109
UT code for WoS article
000305706700005
EID of the result in the Scopus database
—