こちらのポスター

情報科学系セミナー（第１回）
テーマ
“Ge o m e t r i c P u z z l e s : A l g o r i t h m s a n d C o m p l e x i t y ”
講演者： E r i k D . D e m a i n e
P r o f e s s o r o f C o m p u t e r S c ie n c e
Ma s sa c h u se t t s I n st i t u t e o f T e c h n o l o gy
日時：平成２８年５月２４日（火）１５：２０～１６：２０
場所：情報科学系 Ⅲ 棟５階コラボ７
講演要旨：
I love geometry because the problems and solutions are fun and often tangible.
Puzzles are one way to express these two features, and are also a great source of
their own computational geometry problems: which puzzles can be solved and/or
designed efficiently using computer algorithms?
Proving puzzles to be computationally difficult leads to a mathematical sort of
puzzle, designing gadgets to build computers out of puzzles.
I will describe a variety of algorithmic and computational complexity results on
geometric puzzles, focusing on more playful and recent results.
講演者略歴：
Erik D. Demaine is a professor of Computer Science at the Massachusetts
Institute of Technology.
He entered Dalhousie University when he was 12, and completed his Ph.D at
University of Waterloo when he was 20 years old. Since then, he has been one of
the top researchers in the world.
See http://erikdemaine.org/ for further details.
参加申込・予約は不要です。直接会場にお越しください。
お問合せ先：共通事務管理課共通事務第二係（ E -m a i l ： i s - s e c r ）

Download Report