CURRENTLY SOLD OUT
About this product
Product Information
One of the most used in practice is the task for computation of greatest common divisor. In nowadays we give a new treatment of this scientific branch. From historical sources it is known that Greek mathematician Euclid describes such iteration process. His original description uses arithmetic operation 'difference'. Many years later when numerical methods and especially computers are developed Knuth gives a computer algorithm to calculate greatest common divisor with the help of 'remainder' operation. The faster algorithms can be received by combining two approaches - for example such are: least absolute remainder algorithm, Stein' algorithm, Harris' algorithm, and Tembhurne-Sathe' algorithm. Our research show that the best computational results are received by presented in this book new realizations of: the least absolute remainder algorithm for regular integers and Tembhurne-Sathe algorithm for long integers.Product Identifiers
PublisherLAP Lambert Academic Publishing
ISBN-139786139456130
eBay Product ID (ePID)12049020076
Product Key Features
Book TitleNontrivial Practical Algorithms
AuthorAsen Rahnev, Nikolay Kyurkchiev, Anton Iliev
FormatPaperback
LanguageEnglish
Publication Year2019
Number of Pages136 Pages
Dimensions
Item Height229mm
Item Width152mm
Item Weight209g
Additional Product Features
Title_AuthorAnton Iliev, Nikolay Kyurkchiev, Asen Rahnev
