|
|
 |
| Результат поиска |
Поиск книг, содержащих: Euclid’s algorithm
| Книга | Страницы для поиска | | Кормен Т., Лейзерсон Ч., Ривест Р. — Алгоритмы: построение и анализ | 742 | | Wicker S.B., Kim S. — Fundamentals of Codes, Graphs, and Iterative Decoding | 18 | | Olds C.D., Davidoff G. — Geometry of Numbers | 10, 136 | | Cohen H.A. — A Course in Computational Algebraic Number Theory | 12 | | Jones J.A., Jones J.M. — Elementary Number Theory | 5 | | Ross Sh.M. — Topics in Finite and Discrete Mathematics | 25 | | Braunstein S.L. — Quantum computing | 15, 19, 27 | | Olds C.D. — Continued Fractions | 16 | | Hein J.L. — Discrete Structures, Logic, and Computability | 67 | | Lawrence C. Paulson — ML for the working programmer | see “Greatest Common Divisor” | | Aho A.V., Ullman J.D. — The Theory of Parsing, Translation, and Compiling, Volume 1: Parsing | 26—27, 36 | | Tignol J.-P. — Galois' Theory of Algebraic Equations | 27, 44 | | Kurosh A. — Higher Algebra | 133, 136, 241 | | Ralston A., Wilf H.S. — Mathematical methods for digital computers | 194 | | Leeuwen J.V. — Handbook of Theoretical Computer Science: Algorithms and Complexity | 646 | | Baker A. — A Concise Introduction to the Theory of Numbers | 3, 6, 46, 67 | | Leeuwen J. (ed.), Meyer A.R., Nivat M. — Algorithms and Complexity, Volume A | 646 | | Geddes K., Czapor S., Labahn G. — Algorithms for computer algebra | 14, 33—34, 42, 158, 279—280, 305—306, 315, 393, 411—412, 447 | | Hazewinkel M. — Handbook of Algebra (часть 1) | 414 | | Ore O. — Invitation to Number Theory | 46 | | Childs L. — A concrete introduction to higher algebra | 21, 161, 221, 318 |
|
|
|
|
О проекте