Information and Systems-Theoretical Foundations of Computing(Date:2006/03/16)

Presentation
表紙

,  

[Date]2006/3/16
[Paper #]
目次

,  

[Date]2006/3/16
[Paper #]
Increasing the Success Probability of PPSZ-type Satisfiability Testing

Kazuo IWAMA,  Suguru TAMAKI,  

[Date]2006/3/16
[Paper #]COMP2005-63
Complexity of the pairing strategy for Shannon switching game

Ryosuke TAKAHASHI,  Eiji TAKIMOTO,  Akira MARUOKA,  

[Date]2006/3/16
[Paper #]COMP2005-64
Parsing using Syntactic Feature

Yuu TSURUOKA,  

[Date]2006/3/16
[Paper #]COMP2005-65
Improved Lower Bounds for Families of ε-Approximate k-Restricted Min-Wise Independent Permutations

Toshiya ITOH,  Tatsuya NAGATANI,  

[Date]2006/3/16
[Paper #]COMP2005-66
Recognition of Tree-Shellable Boolean Functions with Several Restrictions

Nao KATOUGI,  Yasuhiko TAKENAGA,  Takashi ISHIBASHI,  

[Date]2006/3/16
[Paper #]COMP2005-67
Improvement of the Round Complexity of Perfectly Concealing Bit Commitment Schemes

Yoshiharu SERI,  Takeshi KOSHIBA,  

[Date]2006/3/16
[Paper #]COMP2005-68
コンピュテーション研究専門委員会からのお知らせ

,  

[Date]2006/3/16
[Paper #]
複写される方へ

,  

[Date]2006/3/16
[Paper #]
奥付

,  

[Date]2006/3/16
[Paper #]