IEICE Technical Report

Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380

Theoretical Foundations of Computing

Workshop Date : 2013-06-24 / Issue Date : 2013-06-17

COMP2013-19
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.)
pp. 1 - 6

COMP2013-20
Shortest Path Queries by Labeling for Paths with Pruning in Road Networks
Yuki Kawata, Takuya Akiba, Yoichi Iwata (Univ. of Tokyo)
pp. 7 - 15

COMP2013-21
Bethe Approximation, Loop Series and Partition Function Zeros
Ryuhei Mori (Tokyo Inst. of Tech.)
pp. 17 - 20

COMP2013-22
[Tutorial Lecture] Introduction to Computational Complexity Theory (3): Mathematical Programming Approaches to the Limitations of Computation
Kenya Ueno (Kyoto Univ.)
p. 21

COMP2013-23
On a parametic integer programming algorithm using dualization of monotone Boolean function
Norie Fu (NII), Takafumi Shibuta (Kyushu Univ.)
pp. 23 - 30

COMP2013-24
Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete
Hirotada Kobayashi (NII), Francois Le Gall (Univ. of Tokyo), Harumichi Nishimura (Nagoya Univ.)
pp. 31 - 38

Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.

The Institute of Electronics, Information and Communication Engineers (IEICE), Japan