Information and Systems-Theoretical Foundations of Computing(Date:2007/10/09)

Presentation
表紙

,  

[Date]2007/10/9
[Paper #]
目次

,  

[Date]2007/10/9
[Paper #]
NP-Completeness of the Stable Roommates Problem with Triple Rooms

Kazuya OKAMOTO,  Shuichi MIYAZAKI,  Kazuo IWAMA,  

[Date]2007/10/9
[Paper #]COMP2007-41
Complexity of Finding Most Likely Solutions

Osamu WATANABE,  

[Date]2007/10/9
[Paper #]COMP2007-42
An exact algorithm for #2SAT based on dynamic programming on path decomposition

Mitsuo MOTOKI,  

[Date]2007/10/9
[Paper #]COMP2007-43
Connectedness of domino tilings with impurities

Hirotaka ONO,  Taizo SADAHIRO,  

[Date]2007/10/9
[Paper #]COMP2007-44
A winning strategy for Snaky with one handicap

Hiro ITO,  Hiromitsu MIYAGAWA,  

[Date]2007/10/9
[Paper #]COMP2007-45
An O(2^<0.24945n>)-time and Polynomial-space Algorithm for Finding a Maximum Clique

Hiroaki NAKANISHI,  Etsuji TOMITA,  

[Date]2007/10/9
[Paper #]COMP2007-46
A polynomial-time algorithm for checking the equivalence of real-time strict deterministic restricted one-counter transducers

Kazushi SEINO,  Etsuji TOMITA,  Mitsuo WAKATSUKI,  

[Date]2007/10/9
[Paper #]COMP2007-47
コンピュテーション研究専門委員会からのお知らせ

,  

[Date]2007/10/9
[Paper #]
複写される方へ

,  

[Date]2007/10/9
[Paper #]
Notice for Photocopying

,  

[Date]2007/10/9
[Paper #]
奥付

,  

[Date]2007/10/9
[Paper #]