IEICE Technical Report

Print edition: ISSN 0913-5685      Online edition: ISSN 2432-6380

Volume 115, Number 235

Theoretical Foundations of Computing

Workshop Date : 2015-10-02 / Issue Date : 2015-09-25

[PREV] [NEXT]

[TOP] | [2012] | [2013] | [2014] | [2015] | [2016] | [2017] | [2018] | [Japanese] / [English]

[PROGRAM] [BULK PDF DOWNLOAD]


Table of contents

COMP2015-22
Upper and lower bounds and time complexities on the Frobenius problem obtained from analysing its additive structure
Shunichi Matsubara (Aoyama Gakuin Univ.)
pp. 1 - 5

COMP2015-23
Online Bayesian estimation of Randomized Response models
Tota Suko, Shunsuke Horii (Waseda Univ)
pp. 7 - 11

COMP2015-24
Quantum Algorithm for Triangle Finding in Sparse Graphs
Francois Le Gall, Shogo Nakajima (Univ. of Tokyo)
pp. 13 - 16

COMP2015-25
Quantum Merlin-Arthur with Clifford Arthur
Tomoyuki Morimae (Gunma Univ.), Masahito Hayashi, Harumichi Nishimura (Nagoya Univ.), Keisuke Fujii (Kyoto Univ.)
pp. 17 - 21

COMP2015-26
Some Aspects of Commutation in Clone Theory
Hajime Machida
pp. 23 - 28

COMP2015-27
Complexity of Single Dominating Cycle Problems
Hiroshi Eto, Hiroyuki Kawahara, Eiji Miyano (Kyutech)
pp. 29 - 34

COMP2015-28
Efficiency of template matching using the Monte Carlo method
Noriaki Hayashizaki, Koji Obokata (NIT, Ichinoseki College)
pp. 35 - 40

COMP2015-29
An Improvement of Crossover in Assembly of Jigsaw Puzzles Using a GA
Kazuyuki Takahashi, Koji Obokata (NIT, Ichinoseki College)
pp. 41 - 46

Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan