Isbn: 9786139456130 - nontrivial practical algorithms: part 2 (5 resultados)

Taschenbuch. Condición: Neu. Nontrivial Practical Algorithms | Part 2 | Anton Iliev (u. a.) | Taschenbuch | 136 S. | Englisch | 2019 | LAP LAMBERT Academic Publishing | EAN 9786139456130 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu. …

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 136 pp. Englisch.…

Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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.…

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Iliev AntonThe authors are Professors in University of Plovdiv Paisii Hilendarski, Faculty of Mathematics and Informatics, Department of Computer Technology. Up to now, they have more than 600 papers and 12 monographs in the field of. …

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 136 pp. Englisch.…