Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
Авторизация

       
blank
Поиск по указателям

blank
blank
blank
Красота
blank
Bach E., Shallit J. — Algorithmic Number Theory (том 1)
Bach E., Shallit J. — Algorithmic Number Theory (том 1)



Обсудите книгу на научном форуме



Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter


Название: Algorithmic Number Theory (том 1)

Авторы: Bach E., Shallit J.

Аннотация:

"[Algorithmic Number Theory] is an enormous achievement and an extremely valuable reference." — Donald E. Knuth, Emeritus, Stanford University
Algorithmic Number Theory provides a thorough introduction to the design and analysis of algorithms for problems from the theory of numbers. Although not an elementary textbook, it includes over 300 exercises with suggested solutions. Every theorem not proved in the text or left as an exercise has a reference in the notes section that appears at the end of each chapter. The bibliography contains over 1,750 citations to the literature. Finally, it successfully blends computational theory with practice by covering some of the practical aspects of algorithm implementations. The subject of algorithmic number theory represents the marriage of number theory with the theory of computational complexity. It may be briefly defined as finding integer solutions to equations, or proving their non-existence, making efficient use of resources such as time and space. Implicit in this definition is the question of how to efficiently represent the objects in question on a computer. The problems of algorithmic number theory are important both for their intrinsic mathematical interest and their application to random number generation, codes for reliable and secure information transmission, computer algebra, and other areas. The first volume focuses on problems for which relatively efficient solutions can be found. The second (forthcoming) volume will take up problems and applications for which efficient algorithms are currently not known. Together, the two volumes cover the current state of the art in algorithmic number theory and will be particularly useful to researchers and students with a special interest in theory of computation, number theory, algebra, and cryptography.


Язык: en

Рубрика: Математика/Теория чисел/Вычислительная теория чисел/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 1996

Количество страниц: 516

Добавлена в каталог: 21.05.2005

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
Zeta function, numerical methods      365
Zeta function, Pade table      250
Zeta function, zero-free region      235 246
Zeta function, zeroes of      249 212—251
Zeugmann, T.      122 151 199
Zhang, C.N.      99
Zhang, L.      xv
Zhang, M.      313
Zheng, Z.-Y.      97
Zierler, N.      149 199
Zimand, M.      315
Zimmer, H.G.      xiv 14 260
Zippel, R.      xiv
Zolotarev, G.      262 343
Zuffellato, D.      64
Zuras, D.      64
1 2 3 4 5 6 7 8 9
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2024
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте