Algorithmic Number Theory Symposium III

9801395 Buhler这个奖项支持了一个为期五天的关于算法数论的国际会议，该会议将于1998年6月在里德学院举行。这是算法数论研讨会（ANTS）系列的第三次会议。ANTS会议的组织不仅鼓励与数论相关的通常类型的数字处理，而且鼓励一些较新的方面，包括代数数论和几何，在其他领域的应用，如密码学，以及计算复杂性的理论研究。20年前，许多这样的想法对数论学家来说似乎是非常陌生的，但它们日益增长的重要性导致人们普遍认为需要一个完全致力于算法问题的会议，包括实践和理论。这次会议属于数论的一般数学领域。数论的历史根源在于对整数的研究，解决的问题是一个整数能被另一个整数整除的问题。它是数学中最古老的分支之一，人们为了纯粹的美学原因而追求了许多世纪。然而，在过去的半个世纪里，它已经成为数据传输和处理、密码学和通信系统等各种应用领域不可或缺的工具。

9801395 Buhler This award supports a five-day international conference on algorithmic number theory to be held at Reed College in June 1998. This is the third conference in the Algorithmic Number Theory Symposia (ANTS) series. The ANTS conferences were organized to encourage not only the usual kind of number-crunching associated with number theory, but also some of the newer aspects, including algebraic number theory and geometry, applications to other fields such as cryptography, and theoretical investigations of computational complexity. Twenty years ago many of these ideas would have seemed very foreign to number theorists, but their increasing importance has led to a widely perceived need for a conference devoted entirely to algorithmic concerns, both practical and theoretical. This conference falls into the general mathematical field of number theory. Number theory has its historical roots in the study of the whole numbers, addressing such questions as those dealing with the divisibility of one whole number by another. It is among the oldest branches of mathematics and was pursued for many centuries for purely aesthetic reasons. However, within the last half century it has become an indispensable tool in diverse applications in areas such as data transmission and processing, cryptography, and communication systems.