Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Über die Autorin bzw. den Autor
Os autores são Professores na Universidade de Plovdiv Paisii Hilendarski, Faculdade de Matemática e Informática, Departamento de Informática. Até agora, têm mais de 600 artigos e 12 monografias no campo da Modelação da Informação, Sistemas Distribuídos, Fiabilidade de Software, Teoria dos Algoritmos, Análise Numérica e E-learning.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Suchergebnisse für Nontrivial Practical Algorithms: Part 2
Foto des Verkäufers
Nontrivial Practical Algorithms
Verlag:
LAP LAMBERT Academic Publishing Feb 2019, 2019
ISBN 10: 6139456134
ISBN 13: 9786139456130
Neu
Taschenbuch
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9786139456130
Neu kaufen
EUR 61,90
EUR 23,00 Versand
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 2 verfügbar
Foto des Verkäufers
Nontrivial Practical Algorithms
Verlag:
LAP LAMBERT Academic Publishing, 2019
ISBN 10: 6139456134
ISBN 13: 9786139456130
Neu
Softcover
Anbieter: moluna, Greven, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: 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. Bestandsnummer des Verkäufers 280826886
Neu kaufen
EUR 50,66
EUR 48,99 Versand
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Nontrivial Practical Algorithms
Verlag:
LAP LAMBERT Academic Publishing Feb 2019, 2019
ISBN 10: 6139456134
ISBN 13: 9786139456130
Neu
Taschenbuch
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9786139456130
Neu kaufen
EUR 61,90
EUR 60,00 Versand
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 1 verfügbar
Foto des Verkäufers
Nontrivial Practical Algorithms | Part 2
Verlag:
LAP LAMBERT Academic Publishing, 2019
ISBN 10: 6139456134
ISBN 13: 9786139456130
Neu
Taschenbuch
Anbieter: preigu, Osnabrück, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 115847176
Neu kaufen
EUR 53,25
EUR 70,00 Versand
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 5 verfügbar
Foto des Verkäufers
Nontrivial Practical Algorithms : Part 2
Verlag:
LAP LAMBERT Academic Publishing, 2019
ISBN 10: 6139456134
ISBN 13: 9786139456130
Neu
Taschenbuch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9786139456130
Neu kaufen
EUR 62,64
EUR 61,11 Versand
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 1 verfügbar