Information and Systems-Theoretical Foundations of Computing(Date:2016/06/24)

Presentation
Improving the lower bounds of the number of tilings for Ls in L and Sphinxes in Sphinx

Itsuki Kanemoto(Kobe Univ.),  Toshiki Saitoh(Kobe Univ.),  

[Date]2016-06-24
[Paper #]COMP2016-9
On completeness of polynomial-time counting hierarchy under relaxed subtractive reductions

Shunichi Matsubara(Aoyama Gakuin Univ.),  

[Date]2016-06-24
[Paper #]COMP2016-7
Enumerating Letter Graphs by Zero-suppressed Decision Diagrams

Jun Kawahara(NAIST),  Toshiki Saitoh(Kobe Univ.),  Ryo Yoshinaka(Tohoku Univ.),  

[Date]2016-06-24
[Paper #]COMP2016-8
An algorithm for 3-SAT problems

Hiroshi Tsukimoto(Tokyo Denki Univ.),  

[Date]2016-06-25
[Paper #]COMP2016-10
Contractive graph-minor embedding for CMOS Ising computer

Takuya Okuyama(Hitachi),  Chihiro Yoshimura(Hitachi),  Masato Hayashi(Hitachi),  Saki Tanaka(Hitachi),  Masanao Yamaoka(Hitachi),  

[Date]2016-06-25
[Paper #]COMP2016-11
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),  

[Date]2016-06-25
[Paper #]COMP2016-13
A dual descent algorithm for node-capacitated multiflow problems and its applications

Hiroshi Hirai(Univ. Tokyo),  

[Date]2016-06-25
[Paper #]COMP2016-12