| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP, IPSJ-AL | 2019-05-10 15:40 |
Kumamoto | Kumamoto University | On the Complexity of Lattice Puzzle: Yasuaki Kobayashi, Koki Suetsugu, Hideki Tsuiki (Kyoto Univ), Ryuhei Uehara (JAIST)  COMP2019-2 |
In this paper, we investigate the computational complexity of lattice puzzle, which is one of the traditional puzzles. ... [more] |
COMP2019-2 pp.15-22 |
| COMP | 2015-03-09 15:15 |
Kyoto | Ritsumeikan University | NP-hardness of Finding Minimum Test Set for Detecting Stuck-at and/or Bridging Faults in a Reversible Circuit Hibiki Takakura, Toshinori Yamada (Saitama Univ.) COMP2014-49 |
Reversible circuits are quite attractive because of the possibility of nearly energy-free computation and application to... [more] | COMP2014-49 pp.47-51 |
| COMP | 2013-04-24 16:45 |
Hyogo | Kobe University | Computational complexity and an integer programming model of Shakashaka Erik Demaine (Massachusetts Inst. of Tech.), Yoshio Okamoto (Univ. of Electro-Comm.), Ryuhei Uehara (JAIST), Yushi Uno (Osaka Prefecture Univ.) COMP2013-8 |
The puzzle Shakashaka is popularized by Japanese publisher Nikoli, along with its more famous sibling Sudoku, and severa... [more] | COMP2013-8 pp.43-48 |
| NS, IN (Joint) |
2013-03-08 15:10 |
Okinawa | Okinawa Zanpamisaki Royal Hotel | Method of Finding Protected Data Centers to Keep Loads of Servers and Links Low during Server Failures Keishi Ogura, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2012-271 |
Recently, cloud computing technology has been developed and cloud computing services becomes widespread. In a cloud co... [more] |
NS2012-271 pp.617-622 |
| COMP | 2007-06-29 14:40 |
Hokkaido | Hokkaido University | On the complexity of planar n/k-coloring problems Masakazu Shoji, Akihiro Uejima (Osaka Electro-Communication Univ.) COMP2007-25 |
This paper considers the {\it $n/k$-coloring problem} ({\it Circular Coloring}), which is a subproblem of the $H$-color... [more] |
COMP2007-25 pp.55-62 |
| MSS | 2006-01-27 10:10 |
Kanagawa | Toshiba Kagaku-Kan | On Soundness and Parallel Degree of Workflow Nets Yuji Kaneko, Shingo Yamaguchi, Qi-Wei Ge, Minoru Tanaka (Yamaguchi Univ.) |
This paper discusses soundness and parallel degree of workflow nets (WF-nets). We first define parallel degree that is... [more] |
CST2005-41 pp.13-18 |
| COMP | 2005-03-18 16:50 |
Tokyo | Tokyo Institute of Technology | NP-completeness of maximum chain problem on generalized Puyopuyo Teruhisa Matsukane, Yasuhiko Takenaga (UEC) |
Recently, complexity of the puzzles like Tetris draw our attention. In this report, we deal with Puyopuyo; it is a compu... [more] | COMP2004-85 pp.95-103 |
[Return to Top Page]