Zobrazeno 1 - 10
of 473
pro vyhledávání: '"MIYAMOTO, MASAYUKI"'
Autor:
Miyamoto, Masayuki
The class of graphs that do not contain a path on $k$ nodes as an induced subgraph ($P_k$-free graphs) has rich applications in the theory of graph algorithms. This paper explores the problem of deciding $P_k$-freeness from the viewpoint of distribut
Externí odkaz:
http://arxiv.org/abs/2410.20353
Autor:
Miyamoto, Masayuki
甲第25289号
工博第5248号
新制||工||1999(附属図書館)
学位規則第4条第1項該当
Doctor of Agricultural Science
Kyoto University
DFAM
工博第5248号
新制||工||1999(附属図書館)
学位規則第4条第1項該当
Doctor of Agricultural Science
Kyoto University
DFAM
Externí odkaz:
http://hdl.handle.net/2433/288723
Complexity theory typically focuses on the difficulty of solving computational problems using classical inputs and outputs, even with a quantum computer. In the quantum world, it is natural to apply a different notion of complexity, namely the comple
Externí odkaz:
http://arxiv.org/abs/2303.01877
Publikováno v:
Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023), pp.42:1--42:21, 2023
The study of distributed interactive proofs was initiated by Kol, Oshman, and Saxena [PODC 2018] as a generalization of distributed decision mechanisms (proof-labeling schemes, etc.), and has received a lot of attention in recent years. In distribute
Externí odkaz:
http://arxiv.org/abs/2210.01390
Publikováno v:
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023), pp. 63:1-63:15, 2023
The generation and verification of quantum states are fundamental tasks for quantum information processing that have recently been investigated by Irani, Natarajan, Nirkhe, Rao and Yuen [CCC 2022], Rosenthal and Yuen [ITCS 2022], Metger and Yuen [FOC
Externí odkaz:
http://arxiv.org/abs/2210.01389
Autor:
Gall, François Le, Miyamoto, Masayuki
The distributed subgraph detection asks, for a fixed graph $H$, whether the $n$-node input graph contains $H$ as a subgraph or not. In the standard CONGEST model of distributed computing, the complexity of clique/cycle detection and listing has recei
Externí odkaz:
http://arxiv.org/abs/2110.00741
Publikováno v:
In Clinical Parkinsonism & Related Disorders 2024 11
A recent breakthrough by Ambainis, Balodis, Iraids, Kokainis, Pr\=usis and Vihrovs (SODA'19) showed how to construct faster quantum algorithms for the Traveling Salesman Problem and a few other NP-hard problems by combining in a novel way quantum sea
Externí odkaz:
http://arxiv.org/abs/1904.03581
Autor:
Miyamoto, Tomoyuki, Akaiwa, Yasuhisa, Numahata, Kyoko, Yoshizawa, Kenta, Sairenchi, Toshimi, Miyamoto, Masayuki
Publikováno v:
In Parkinsonism and Related Disorders February 2022 95:107-112
Autor:
Miyamoto, Tomoyuki, Miyamoto, Masayuki, Numahata, Kyoko, Onoue, Hiroyuki, Akaiwa, Yasuhisa, Sairenchi, Toshimi
Publikováno v:
In Journal of the Neurological Sciences 15 July 2020 414