|
|
Special Interest Group on Algorithms (IPSJ-AL) (Searched in: 2016)
|
|
Search Results: Keywords 'from:2016-06-24 to:2016-06-24'
|
[Go to Official IPSJ-AL Homepage] |
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Ascending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
COMP, IPSJ-AL |
2016-06-24 13:45 |
Ishikawa |
|
On completeness of polynomial-time counting hierarchy under relaxed subtractive reductions Shunichi Matsubara (Aoyama Gakuin Univ.) COMP2016-7 |
The polynomial-time hierarchy was introduced by Meyer and Stockmeyer, which is a hierarchy on decision problems and has ... [more] |
COMP2016-7 pp.9-12 |
COMP, IPSJ-AL |
2016-06-24 15:45 |
Ishikawa |
|
Enumerating Letter Graphs by Zero-suppressed Decision Diagrams Jun Kawahara (NAIST), Toshiki Saitoh (Kobe Univ.), Ryo Yoshinaka (Tohoku Univ.) COMP2016-8 |
A zero-suppressed binary decision diagram (ZDD) is a compact data structure that represents a family of sets. A framewor... [more] |
COMP2016-8 pp.33-40 |
COMP, IPSJ-AL |
2016-06-24 16:10 |
Ishikawa |
|
Improving the lower bounds of the number of tilings for Ls in L and Sphinxes in Sphinx
-- Enumerating tilings by frontier-based search -- Itsuki Kanemoto, Toshiki Saitoh (Kobe Univ.) COMP2016-9 |
We treat with puzzles which are filled by copies of a polygon in the polygon enlarged in a certain scale. We call ... [more] |
COMP2016-9 pp.41-47 |
COMP, IPSJ-AL |
2016-06-25 13:15 |
Ishikawa |
|
An algorithm for 3-SAT problems Hiroshi Tsukimoto (Tokyo Denki Univ.) COMP2016-10 |
This paper presents an algorithm for 3-SAT problems. First, logical formulas are transformed into elementary algebraic f... [more] |
COMP2016-10 pp.89-96 |
COMP, IPSJ-AL |
2016-06-25 13:40 |
Ishikawa |
|
Contractive graph-minor embedding for CMOS Ising computer Takuya Okuyama, Chihiro Yoshimura, Masato Hayashi, Saki Tanaka, Masanao Yamaoka (Hitachi) COMP2016-11 |
We proposed CMOS Ising computer, which maps the combinatorial optimization problems to the ground state search of Ising ... [more] |
COMP2016-11 pp.97-103 |
COMP, IPSJ-AL |
2016-06-25 14:05 |
Ishikawa |
|
A dual descent algorithm for node-capacitated multiflow problems and its applications Hiroshi Hirai (Univ. Tokyo) COMP2016-12 |
In this paper, we develop an $O(m n^3log k)$-time algorithm to find
a half-integral node-capacitated multiflow of the... [more] |
COMP2016-12 pp.105-108 |
COMP, IPSJ-AL |
2016-06-25 15:05 |
Ishikawa |
|
Computational Complexity of Sequential Token Swapping Problem Katsuhisa Yamanaka (Iwate Univ.), Erik D. Demaine (MIT), Takashi Horiyama (Saitama Univ.), Akitoshi Kawamura (Univ. of Tokyo), Shin-ichi Nakano (Gunma Univ.), Yoshio Okamoto (UEC), Toshiki Saitoh (Kobe Univ.), Akira Suzuki (Tohoku Univ.), Ryuhei Uehara (JAIST), Takeaki Uno (NII) COMP2016-13 |
We consider a puzzle consisting of colored tokens on an $n$-vertex graph, where each token has a distinct starting verte... [more] |
COMP2016-13 pp.115-121 |
|
|
|
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]
|