Print edition: ISSN 0913-5685
Online edition: ISSN 2432-6380
[TOP] | [2006] | [2007] | [2008] | [2009] | [2010] | [2011] | [2012] | [Japanese] / [English]
COMP2005-44
A quantum protocol to win the graph colouring game on all Hadamard graphs
David Avis (McGill Univ.), Jun Hasegawa (Univ. of Tokyo/JST), Yosuke Kikuchi (JST), Yuuya Sasaki (Univ. of Tokyo)
pp. 1 - 6
COMP2005-45
Automated Competitive Analysis of Online Problems
Takashi Horiyama, Kazuo Iwama, Jun Kawahara (Kyoto Univ.)
pp. 7 - 12
COMP2005-46
An Approximate Algorithum for Pricing European-Asian Options
Takehisa Sekino, Akiyoshi Shioura, Takeshi Tokuyama (Tohoku Univ.)
pp. 13 - 18
COMP2005-47
Monotone DNFs that Minimize/Maximize the Number of Satisfying Assignments
Kazuyuki Amano (Tohoku Univ.), Takayuki Sato (Sendai Nat. Col. Tech.), Akira Maruoka (Tohoku Univ.)
pp. 19 - 24
COMP2005-48
Some sufficient conditions to solve the learning problem of simple deterministic languages from queries and counterexamples
Yasuhiro Tajima, Yoshiyuki Kotani (Tokyo Univ. of Agri and Tech.), Etsuji Tomita (Univ. of Electro-Comm.)
pp. 25 - 30