Tamaki Suguru

タマキスグル | Tamaki Suguru

Affiliation and department：
Job title： Professor
Homepage URL (2)： https://sites.google.com/view/sugur/home-jp , https://sites.google.com/view/sugur/home-en

Research field (1)： Information theory

Research theme for competitive and other funds (13)：

2022 - 2026 制約充足問題の新しい系統的な研究
2020 - 2025 アルゴリズム基礎理論の追究・発展
2020 - 2025 Research Initiatives on Algorithmic Foundations for Social Advancement
2018 - 2023 Algorithms for Constraint Satisfaction Problems: Deepening and New Directions
2018 - 2022 Computational Complexity of Minimum Description Size Problems

Show all

Papers (40)：

ｍore...

MISC (8)：

平田峻介, LE GALL Francois, 玉置卓, 照山順一. NP-hardness of k-modularity maximization on sparse graphs. 電子情報通信学会技術研究報告. 2018. 118. 216(COMP2018 9-20)(Web)
An Exact Algorithm for the Satisfiability of Depth-2 SYM-AND Circuits (Theoretical Foundations of Computing). 2016. 116. 262. 29-34
TAMAKI Suguru. Introduction to Computational Complexity Theory (4): Barriers in Proving the Limits of Computation. IEICE technical report. Theoretical foundations of Computing. 2013. 113. 252. 21-21
Iwama Kazuo, Seto Kazuhisa, Tamaki Suguru. DS-1-4 Enumerating Non-3-colorable Planar Graphs by the Hajos Calculus. Proceedings of the IEICE General Conference. 2010. 2010. 1. "S-7"-"S-8"
Kinoshita Naoki, Tamaki Suguru, Iwama Kazuo. An Improvement of the Soundness of a 3-bit PCP (Theoretical Computer Science and Its Applications). RIMS Kokyuroku. 2009. 1649. 129-136

ｍore...

Books (2)：

Lectures and oral presentations (30)：

ｍore...

Professional career (1)：

※ Researcher’s information displayed in J-GLOBAL is based on the information registered in researchmap. For details, see here.

Return to Previous Page