Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380
[TOP] | [2011] | [2012] | [2013] | [2014] | [2015] | [2016] | [2017] | [Japanese] / [English]
COMP2014-25
On Extended Complexity of Generalized Transversal Matroids
Shuichi Hirahara, Hiroshi Imai (Univ. of Tokyo)
pp. 1 - 4
COMP2014-26
The State Complexity of Two-Way Quantum Finite Automata
Marcos Villagra, Tomoyuki Yamakami (Univ. of Fukui)
pp. 5 - 8
COMP2014-27
Algorithms for the Minimum Vulnerability Problem
Yusuke Aoki (Tohoku Univ.), Bjarni V. Halldorsson, Magnus M. Halldorsson (Reykjavik Univ.), Takehiro Ito (Tohoku Univ.), Christian Konrad (Reykjavik Univ.), Xiao Zhou (Tohoku Univ.)
pp. 9 - 15
COMP2014-28
[Invited Talk]
Statistical Maximum and Minimum Operations for Gaussian Mixture Model and Their Applications
Shuji Tsukiyama (Chuo Univ.)
pp. 17 - 18
COMP2014-29
Reconfiguration of List Colorings in a Graph
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou (Tohoku Univ.)
pp. 19 - 24
COMP2014-30
Fast Indexing All Eulerian Trails Using Permutation Decision Diagrams
Yuma Inoue, Shin-ichi Minato (Hokkaido Univ.)
pp. 25 - 29
COMP2014-31
Implicant Size of a CNF Formula with Many Satisfying Assignments
Daniel Kane (Stanford Univ.), Osamu Watanabe (Tokyo Inst. of Tech.)
pp. 31 - 37
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.