|
|
| Chair |
|
Keio Imai (Chuo Univ.) |
| Vice Chair |
|
Hiroo Ito (Univ. of Electro-Comm.) |
| Secretary |
|
Akitoshi Kawamura (Univ. of Tokyo), Jinhee Jon (Tohoku Univ.) |
|
| Conference Date |
Mon, Jun 24, 2013 10:00 - 16:20 |
| Topics |
|
| Conference Place |
|
Mon, Jun 24 AM
10:00 - 16:20 |
| (1) |
10:00-10:35 |
Morpion Solitaire: a new upper bound 121 of the maximum score |
Akitoshi Kawamura (Univ. of Tokyo), Takuma Okamoto, Yuichi Tatsu, Yushi Uno, Masahide Yamato (Osaka Prefecture Univ.) |
| (2) |
10:35-11:10 |
Shortest Path Queries by Labeling for Paths with Pruning in Road Networks |
Yuki Kawata, Takuya Akiba, Yoichi Iwata (Univ. of Tokyo) |
| (3) |
11:10-11:45 |
Bethe Approximation, Loop Series and Partition Function Zeros |
Ryuhei Mori (Tokyo Inst. of Tech.) |
| |
11:45-13:20 |
Break ( 95 min. ) |
| (4) |
13:20-14:50 |
[Tutorial Lecture]
Introduction to Computational Complexity Theory (3): Mathematical Programming Approaches to the Limitations of Computation |
Kenya Ueno (Kyoto Univ.) |
| |
14:50-15:10 |
Break ( 20 min. ) |
| (5) |
15:10-15:45 |
On a parametic integer programming algorithm using dualization of monotone Boolean function |
Norie Fu (NII), Takafumi Shibuta (Kyushu Univ.) |
| (6) |
15:45-16:20 |
Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete |
Hirotada Kobayashi (NII), Francois Le Gall (Univ. of Tokyo), Harumichi Nishimura (Nagoya Univ.) |
| Announcement for Speakers |
| General Talk | Each speech will have 25 minutes for presentation and 10 minutes for discussion. |
| Contact Address and Latest Schedule Information |
| COMP |
Technical Committee on Theoretical Foundations of Computing (COMP) [Latest Schedule]
|
| Contact Address |
Akitoshi Kawamura
Department of Computer Science,
University of Tokyo,
7-3-1 Hongo, Bunkyo-ku,
Tokyo, Japan 113-8656
Email:      is su-  |
Last modified: 2013-04-15 22:07:34
|