ISBN: 9786138386391 - new trends in practical algorithms: some computational and approximation aspects (8 risultati)

Condizione: New.

Taschenbuch. Condizione: Neu. New Trends in Practical Algorithms | Some Computational and Approximation Aspects | Anton Iliev (u. a.) | Taschenbuch | 128 S. | Englisch | 2018 | LAP LAMBERT Academic Publishing | EAN 9786138386391 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.…

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Numerous tasks in Computer Science lead to computation of greatest common divisor. In this book the focus is on optimization of known realizations based on Knuth's ideas. We make attempts to minimize the number of assignments and the number of comparisons. These algorithms are commented and cited in every book of algorithms. The new insight in novel algorithms' realization presented in this book is that we unite the two iteration steps into one with aim to receive solutions for shorter CPU time and our approach become in the style of Anatoly Karatsuba's 'divide and conquer' algorithmic technique. We receive some benefits and our results can be reflect in many books for classical algebra in present days. The ideas in presented algorithms here can be used in training for hard programming contents such as International Olympiad in Informatics (IOI). The book will be extremely useful for students, teachers in algorithms, PhD students, university lecturers in algebra, professionals and specialists in Computer Science, Algorithm Complexity', Speed of Computer Programmes Performance and for every who deals with practical solutions using programming languages and contemporary computers. 128 pp. Englisch.…

Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Numerous tasks in Computer Science lead to computation of greatest common divisor. In this book the focus is on optimization of known realizations based on Knuth's ideas. We make attempts to minimize the number of assignments and the number of comparisons. These algorithms are commented and cited in every book of algorithms. The new insight in novel algorithms' realization presented in this book is that we unite the two iteration steps into one with aim to receive solutions for shorter CPU time and our approach become in the style of Anatoly Karatsuba's 'divide and conquer' algorithmic technique. We receive some benefits and our results can be reflect in many books for classical algebra in present days. The ideas in presented algorithms here can be used in training for hard programming contents such as International Olympiad in Informatics (IOI). The book will be extremely useful for students, teachers in algorithms, PhD students, university lecturers in algebra, professionals and specialists in Computer Science, Algorithm Complexity', Speed of Computer Programmes Performance and for every who deals with practical solutions using programming languages and contemporary computers.…

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Iliev AntonProf. Anton lliev and Prof. Nikolay Kyurkchiev are from University of Plovdiv Paisii Hilendarski, Faculty of Mathematics and Informatics. Up to now, they have more than 60 joint papers and 2 joint monographs in the field o.…

Condizione: New. Print on Demand.

Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Numerous tasks in Computer Science lead to computation of greatest common divisor. In this book the focus is on optimization of known realizations based on Knuth's ideas. We make attempts to minimize the number of assignments and the number of comparisons. These algorithms are commented and cited in every book of algorithms. The new insight in novel algorithms' realization presented in this book is that we unite the two iteration steps into one with aim to receive solutions for shorter CPU time and our approach become in the style of Anatoly Karatsuba's 'divide and conquer' algorithmic technique. We receive some benefits and our results can be reflect in many books for classical algebra in present days. The ideas in presented algorithms here can be used in training for hard programming contents such as International Olympiad in Informatics (IOI). The book will be extremely useful for students, teachers in algorithms, PhD students, university lecturers in algebra, professionals and specialists in Computer Science, Algorithm Complexity', Speed of Computer Programmes Performance and for every who deals with practical solutions using programming languages and contemporary computers.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 128 pp. Englisch.…

Condizione: New. PRINT ON DEMAND.