Print edition: ISSN 0913-5685
Online edition: ISSN 2432-6380
[TOP] | [2006] | [2007] | [2008] | [2009] | [2010] | [2011] | [2012] | [Japanese] / [English]
COMP2005-63
Increasing the Success Probability of PPSZ-type Satisfiability Testing
Kazuo Iwama, Suguru Tamaki (Kyoto Univ.)
pp. 1 - 6
COMP2005-64
Complexity of the pairing strategy for Shannon switching game
Ryosuke Takahashi, Eiji Takimoto, Akira Maruoka (Tohoku Univ.)
pp. 7 - 14
COMP2005-65
Parsing using syntactic feature
Yuu Tsuruoka (UEC)
pp. 15 - 21
COMP2005-66
Improved Lower Bounds for Families of ε -Approximate k-Restricted Min-Wise Independent Permutations
Toshiya Itoh, Tatsuya Nagatani (Tokyo Inst. of Tech.)
pp. 23 - 30
COMP2005-67
Recognition of Tree-Shellable Boolean Functions with several Restrictions
Nao Katougi, Yasuhiko Takenaga, Takashi Ishibashi (UEC)
pp. 31 - 37
COMP2005-68
Improvement of the Round Complexity of Perfectly Concealing Bit Commitment Schemes
Yoshiharu Seri, Takeshi Koshiba (Saitama Univ.)
pp. 39 - 46