An Algorithm for Accelerated Acquirement of Minimal Representation of Super-Large Numbers. An Algorithm for Accelerated Acquirement of Minimal Representation of Super-Large Numbers.

An Algorithm for Accelerated Acquirement of Minimal Representation of Super-Large Numbers‪.‬

Journal of Computer Science 2006, Dec, 2, 12

Journal of Computer Science
    • 2,99 €
    • 2,99 €

Beschreibung des Verlags

Abstract: An algorithm for accelerated acquirement of minimal representation of super-large numbers was presented. The algorithm considers a new form of arithmetic, which was called arithmetic of q-representation of large range integers; which was based on the numbers of the generalized sequence of Fibonacci. The estimations of the complexity of the offered algorithms are presented. Key words: M-representation, integer number, fibonacci p-number, fibonacci p-codes

GENRE
Computer und Internet
ERSCHIENEN
2006
1. Dezember
SPRACHE
EN
Englisch
UMFANG
12
Seiten
VERLAG
Science Publications
ANBIETERINFO
The Gale Group, Inc., a Delaware corporation and an affiliate of Cengage Learning, Inc.
GRÖSSE
173,9
 kB

Mehr ähnliche Bücher

Computer Algebra in Scientific Computing Computer Algebra in Scientific Computing
Computer Algebra in Scientific Computing
2022
Arithmetic of Finite Fields Arithmetic of Finite Fields
Arithmetic of Finite Fields
2023
Integer Algorithms In Cryptology And Information Assurance Integer Algorithms In Cryptology And Information Assurance
Integer Algorithms In Cryptology And Information Assurance
2014
Computer Algebra in Scientific Computing Computer Algebra in Scientific Computing
Computer Algebra in Scientific Computing
2021
Algorithmic Number Theory Algorithmic Number Theory
Algorithmic Number Theory
2008
Matters Computational Matters Computational
Matters Computational
2010

Mehr Bücher von Journal of Computer Science

Data Mining: A Preprocessing Engine. Data Mining: A Preprocessing Engine.
Data Mining: A Preprocessing Engine.
2006
An Exact Algorithm for the Unbounded Knapsack Problem with Minimizing Maximum Processing Time. An Exact Algorithm for the Unbounded Knapsack Problem with Minimizing Maximum Processing Time.
An Exact Algorithm for the Unbounded Knapsack Problem with Minimizing Maximum Processing Time.
2007
Effective Factors on Iranian Consumers Behavior in Internet Shopping: A Soft Computing Approach (Report) Effective Factors on Iranian Consumers Behavior in Internet Shopping: A Soft Computing Approach (Report)
Effective Factors on Iranian Consumers Behavior in Internet Shopping: A Soft Computing Approach (Report)
2009
New Cryptosystem Using Multiple Cryptographic Assumptions (Report) New Cryptosystem Using Multiple Cryptographic Assumptions (Report)
New Cryptosystem Using Multiple Cryptographic Assumptions (Report)
2011
Childhood Cancer-a Hospital Based Study Using Decision Tree Techniques (Report) Childhood Cancer-a Hospital Based Study Using Decision Tree Techniques (Report)
Childhood Cancer-a Hospital Based Study Using Decision Tree Techniques (Report)
2011
Exploring the Relationship Between Cohesion and Complexity. Exploring the Relationship Between Cohesion and Complexity.
Exploring the Relationship Between Cohesion and Complexity.
2005