Research keywords (3):
design and anallysis of algorithms
, computational complexity
, theory of computation
Research theme for competitive and other funds (2):
2012 - 2016 Exploring the Limits of Computation from the Statistical Physics
2011 - 2013 Proposing new sapmling algorithms
Papers (29):
Naoki Matsumoto, Masaki Yamamoto 0001, Masahito Yamazaki. The minimum number of vertices of graphs containing two monochromatic triangles for any edge $2$-coloring. Australas. J Comb. 2021. 81. 208-232
Yamamoto Masaki, Kijima Shuji, Matsui Yasuko. A Polynomial-time Perfect Sampler for the Q-Ising with local fields (Mathematical Foundation of Algorithms and Computer Science). RIMS Kokyuroku. 2010. 1691. 78-84
Yoshida Yuichi, Yamamoto Masaki, Ito Hiro. DS-1-1 Improved Constant-Time Approximation Algorithms for Maximum Independent Sets and Maximum Matchings. Proceedings of the IEICE General Conference. 2009. 2009. 1. "S-21"-"S-22"
Watanabe Osamu, Yamamoto Masaki. A Planted Solution Model for the MAX-2SAT Problem(Mathematical Structure of Information Physics). RIMS Kokyuroku. 2007. 1532. 19-31
Watanabe Osamu, Yamamoto Masaki. A Message Passing Algorithm for MAX2SAT(New Trends in Theory of Computation and Algorithm). RIMS Kokyuroku. 2006. 1489. 106-113
Professional career (1):
博士(理学) (東京工業大学)
Work history (1):
2012 - Seikei University Faculty of Science and Technology