Tamaki Lab
Graduated from the Faculty of Engineering, Kyoto University in 2001, and the Graduate School of Informatics, Kyoto University in 2006. He was a postdoctoral fellow and an assistant professor at Kyoto University and an associate professor at the University of Hyogo. He has been in his current position since April 2024. He was a visiting scholar at the University of California, San Diego and University of California, Berkeley in 2015 and at Carnegie Mellon University in 2022.
【Research Interests】
In general, finding the optimal solution to an optimization problem is not easy. The main reasons are combinatorial explosion (NP-hard), too large data size, incomplete data, etc. We are tackling such computationally difficult optimization problems with approaches such as “exact algorithms” (exponential time), “approximation algorithms” (polynomial time to constant time), and “quantum algorithms”. Specifically, we consider combinatorial optimization problems such as “Boolean Satisfiability Problems” (SAT), “Constraint Satisfaction Problems” (CSP), “Local Hamiltonian Problems” (LH). We also study the theory of computation, which complements design and analysis of algorithms. The keywords are “inapproximability”, “Boolean circuit complexity”, “quantum advantage”, etc.
Please visit
・researchmap
・Lab website
for more information on my background, areas of expertise, research interests, research achievements, and professional activities.
