| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2023)
Search Results: Keywords 'from:2024-03-14 to:2024-03-14'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2024-03-14 10:30 |
Tokyo | The University of Electro-Communications | Number of Solutions of Pentahex and Heptiamond Puzzles Toshihiro Shirakawa  COMP2023-28 |
Packing puzzles, also known as plastic puzzles, have been considered difficult to calculate the total number of solution... [more] | COMP2023-28 pp.1-5 |
| COMP | 2024-03-14 11:00 |
Tokyo | The University of Electro-Communications | Proof of NP-completeness of Tasukuea Chiho Fukunaga, Seiya Okubo (Univ. of Shizuoka) COMP2023-29 |
In this study, we prove that the existence determination of a solution is NP-complete problem for Tasukuea, a kind of co... [more] | COMP2023-29 pp.6-13 |
| COMP | 2024-03-14 11:30 |
Tokyo | The University of Electro-Communications | Masyu is Constant-Time Testable Kotaro Kabutoishi, Hiro Ito (UEC) COMP2023-30 |
In this presentation, we provide a constant-time tester, or a tester for short, for a board puzzle “Masyu.” This puzzle... [more] |
COMP2023-30 pp.14-21 |
| COMP | 2024-03-14 13:30 |
Tokyo | The University of Electro-Communications | [Invited Talk]
Gap Amplification for Reconfiguration Problems Naoto Ohsaka (CyberAgent) COMP2023-31 |
Combinatorial reconfiguration is an emerging field of theoretical computer science that studies the reachability between... [more] | COMP2023-31 p.22 |
| COMP | 2024-03-14 14:45 |
Tokyo | The University of Electro-Communications | Reforming an Envy-Free Matching with Ties Yuni Iwamasa, Jun Kawahara, Yuito Ueda (Kyoto Univ.) COMP2023-32 |
An envy-free matching is a type of matching between agents and items such that each agent have a preference order for th... [more] | COMP2023-32 pp.23-30 |
| COMP | 2024-03-14 15:15 |
Tokyo | The University of Electro-Communications | A proof of recurrence of a random walk on a growing network by a coupling technique Shuma Kumamoto (Kyushu U), Shuji Kijima (Shiga U), Tomoyuki Shirai (Kyushu U) COMP2023-33 |
[more] | COMP2023-33 pp.31-33 |
| COMP | 2024-03-14 16:00 |
Tokyo | The University of Electro-Communications | Time Analysis of Space Efficient Uniform Partitioning in Population Protocols Pascal Sahner (NAIST/RWTH Aachen), Ryota Eguchi (NAIST), Fukuhito Ooshita (FUT), Michiko Inoue (NAIST) COMP2023-34 |
Population protocols are a theoretical model for modeling a set of units with low computational capabilities - so called... [more] | COMP2023-34 pp.34-41 |
| COMP | 2024-03-14 16:30 |
Tokyo | The University of Electro-Communications | A consideration on the spannig polytope volume using the recurrence representation and its computation Ei Ando (Senshu Univ.) COMP2023-35 |
In this paper, we consider the volume of the spanning tree polytope and we can compute its volume exactly in polynomi... [more] |
COMP2023-35 pp.42-49 |
[Return to Top Page]