Algorithmic Ways for Mathematical Puzzles
暫譯: 數學謎題的演算法解法
Uehara, Ryuhei
- 出版商: A K Peters
- 出版日期: 2026-12-16
- 售價: $6,110
- 貴賓價: 9.5 折 $5,804
- 語言: 英文
- 頁數: 120
- 裝訂: Hardcover - also called cloth, retail trade, or trade
- ISBN: 1041018908
- ISBN-13: 9781041018902
-
相關分類:
Algorithms-data-structures、離散數學 Discrete-mathematics
尚未上市,無法訂購
相關主題
商品描述
Algorithmic Ways for Mathematical Puzzles introduces puzzles from all over the world, past and present, from the perspective of theoretical computer science. Certain types of puzzles have contributed greatly to the development of this field. In fact, the latest puzzles often provide new research themes for computer scientists, whether the puzzle designer intended this outcome or not.
This book explores the current landscape, including such unsolved problems that are still extant. The contents of this book can be read by high school students with reasonable mathematical comprehension skills, but from an academic level it is mainly targeted at undergraduate and graduate students with an interest in algorithms and an appetite for puzzles.
Features:
- Presents a wonderfully engaging teaching resource for a class on algorithmics
- Full of interesting and previously unpublished puzzles
- Copiously illustrated in full color.
商品描述(中文翻譯)
《數學謎題的演算法途徑》從理論計算機科學的角度,介紹來自世界各地、跨越古今的謎題。某些類型的謎題對這個領域的發展貢獻良多。事實上,最新的謎題往往會為計算機科學家提供新的研究主題,無論謎題設計者是否原本就有意達成這樣的結果。
本書探討目前的研究景況,包括至今仍未解決、持續存在的問題。本書內容具備合理數學理解能力的高中生即可閱讀;但就學術程度而言,主要是以對演算法(algorithms)有興趣、且熱愛謎題的大學生與研究生為對象。
特色:
• 為演算法學課程提供極具吸引力的教學資源
• 收錄大量有趣且先前未曾出版的謎題
• 以豐富的全彩插圖呈現
作者簡介
Ryuhei Uehara is a Professor in the School of Information Science at the Japan Advanced Institute of Science and Technology (JAIST), where he also serves as Vice President and Director of the JAIST Gallery. He received the B.E., M.E., and Ph.D. degrees from The University of Electro-Communications in 1989, 1991, and 1998, respectively. Before joining JAIST in 2004, he held academic positions at Tokyo Woman's Christian University and Komazawa University and worked as a researcher at Canon Inc.. His research interests include computational complexity, algorithms, graph theory, computational origami, and the theory of games and puzzles.
He has published extensively on the computational complexity of puzzles and recreational mathematics from the viewpoint of theoretical computer science. He is Chair of the Japan Chapter of the European Association for Theoretical Computer Science (EATCS). He has also been a visiting researcher at the University of Waterloo, Massachusetts Institute of Technology, ETH Zürich, Simon Fraser University, Universitat Politècnica de Catalunya, and Université libre de Bruxelles.
作者簡介(中文翻譯)
Ryuhei Uehara 是日本先進科學技術研究所(Japan Advanced Institute of Science and Technology,JAIST)資訊科學學院的教授,同時擔任 JAIST 副校長及 JAIST Gallery 館長。他於 1989 年、1991 年及 1998 年分別取得電氣通信大學(The University of Electro-Communications)的學士(B.E.)、碩士(M.E.)及博士(Ph.D.)學位。2004 年加入 JAIST 前,他曾任教於 Tokyo Woman's Christian University 及 Komazawa University,並曾擔任 Canon Inc. 研究員。他的研究興趣包括計算複雜度、演算法、圖論、計算摺紙,以及賽局與益智遊戲理論。
他從理論計算機科學的觀點出發,針對益智遊戲與休閒數學的計算複雜度發表了大量研究成果。他擔任歐洲理論計算機科學協會(European Association for Theoretical Computer Science,EATCS)日本分會主席。此外,他也曾於 University of Waterloo、Massachusetts Institute of Technology、ETH Zürich、Simon Fraser University、Universitat Politècnica de Catalunya 及 Université libre de Bruxelles 擔任訪問研究員。