Algorithmic Number Theory: First International Symposium, ANTS-I, Ithaca, NY, USA, May 6 - 9, 1994. Proceedings (Lecture Notes in Computer Science)
暫譯: 算法數論:第一屆國際研討會 ANTS-I,伊薩卡,紐約,美國,1994年5月6日至9日。會議紀錄(計算機科學講義)

***

  • 出版商: Springer
  • 出版日期: 1994-11-15
  • 售價: $2,470
  • 貴賓價: 9.5$2,347
  • 語言: 英文
  • 頁數: 320
  • 裝訂: Paperback
  • ISBN: 3540586911
  • ISBN-13: 9783540586913
  • 相關分類: Algorithms-data-structuresComputer-Science
  • 海外代購書籍(需單獨結帳)

商品描述

This volume presents the refereed proceedings of the First Algorithmic Number Theory Symposium, ANTS-I, held at Cornell University, Ithaca, NY in May 1994. The 35 papers accepted for inclusion in this book address many current issues of algorithmic, computational and complexity-theoretic aspects of number theory and thus report the state-of-the-art in this exciting area of research; the book also contributes essentially to foundational research in cryptology and coding. Of particular value is a collection entitled "Open Problems in Number Theoretic Complexity, II" contributed by Len Adleman and Kevin McCurley. This survey presents on 32 pages 36 central open problems and relates them to the literature by means of some 160 references.

商品描述(中文翻譯)

本卷呈現了第一屆演算法數論研討會(ANTS-I)的經過審核的會議紀錄,該研討會於1994年5月在美國紐約州伊薩卡的康奈爾大學舉行。這本書收錄了35篇被接受的論文,探討了數論在演算法、計算和複雜性理論方面的許多當前議題,因此報告了這一令人興奮的研究領域的最新進展;本書對於密碼學和編碼的基礎研究也有重要貢獻。特別有價值的是由Len Adleman和Kevin McCurley貢獻的名為「數論複雜性中的開放問題 II」的合集。這份調查在32頁中列出了36個核心開放問題,並通過約160個參考文獻將其與文獻相關聯。