|
|
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2013)
|
|
Search Results: Keywords 'from:2013-06-24 to:2013-06-24'
|
[Go to Official COMP Homepage (Japanese)] |
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Ascending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
COMP |
2013-06-24 10:00 |
Nara |
Nara Women's University |
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.) COMP2013-19 |
Morpion Solitaire is a pencil-and-paper game for a single player, popular in several countries including
France. A move... [more] |
COMP2013-19 pp.1-6 |
COMP |
2013-06-24 10:35 |
Nara |
Nara Women's University |
Shortest Path Queries by Labeling for Paths with Pruning in Road Networks Yuki Kawata, Takuya Akiba, Yoichi Iwata (Univ. of Tokyo) COMP2013-20 |
Shortest-Path problem is a fundamental problem in road networks and a lot of methods are proposed. In the labeling appro... [more] |
COMP2013-20 pp.7-15 |
COMP |
2013-06-24 11:10 |
Nara |
Nara Women's University |
Bethe Approximation, Loop Series and Partition Function Zeros Ryuhei Mori (Tokyo Inst. of Tech.) COMP2013-21 |
Recently, Weitz showed the novel method of self-avoiding tree yielding fully polynomial-time approximation scheme (FPTAS... [more] |
COMP2013-21 pp.17-20 |
COMP |
2013-06-24 13:20 |
Nara |
Nara Women's University |
[Tutorial Lecture]
Introduction to Computational Complexity Theory (3): Mathematical Programming Approaches to the Limitations of Computation Kenya Ueno (Kyoto Univ.) COMP2013-22 |
This presentation corresponds to the third tutorial of the ELC (Exploring the Limits of Computation) project supported b... [more] |
COMP2013-22 p.21 |
COMP |
2013-06-24 15:10 |
Nara |
Nara Women's University |
On a parametic integer programming algorithm using dualization of monotone Boolean function Norie Fu (NII), Takafumi Shibuta (Kyushu Univ.) COMP2013-23 |
The {it parametric integer programing} is the integer programming with a vector of parameters as its right-hand-side vec... [more] |
COMP2013-23 pp.23-30 |
COMP |
2013-06-24 15:45 |
Nara |
Nara Women's University |
Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete Hirotada Kobayashi (NII), Francois Le Gall (Univ. of Tokyo), Harumichi Nishimura (Nagoya Univ.) COMP2013-24 |
This paper presents stronger methods of achieving perfect completeness in quantum interactive proofs. First, it is prove... [more] |
COMP2013-24 pp.31-38 |
|
|
|
Copyright and reproduction :
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
|
[Return to Top Page]
[Return to IEICE Web Page]
|