Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380
[TOP] | [2013] | [2014] | [2015] | [2016] | [2017] | [2018] | [2019] | [Japanese] / [English]
COMP2016-7
On completeness of polynomial-time counting hierarchy under relaxed subtractive reductions
Shunichi Matsubara (Aoyama Gakuin Univ.)
pp. 9 - 12
COMP2016-8
Enumerating Letter Graphs by Zero-suppressed Decision Diagrams
Jun Kawahara (NAIST), Toshiki Saitoh (Kobe Univ.), Ryo Yoshinaka (Tohoku Univ.)
pp. 33 - 40
COMP2016-9
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.)
pp. 41 - 47
COMP2016-10
An algorithm for 3-SAT problems
Hiroshi Tsukimoto (Tokyo Denki Univ.)
pp. 89 - 96
COMP2016-11
Contractive graph-minor embedding for CMOS Ising computer
Takuya Okuyama, Chihiro Yoshimura, Masato Hayashi, Saki Tanaka, Masanao Yamaoka (Hitachi)
pp. 97 - 103
COMP2016-12
A dual descent algorithm for node-capacitated multiflow problems and its applications
Hiroshi Hirai (Univ. Tokyo)
pp. 105 - 108
COMP2016-13
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)
pp. 115 - 121
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.