LAB LOGA page on LabLog, a review site (not the lab's official page)
Takenaga Lab
Machine-translated · View original
The lab is a mathematical informatics lab that studies the fundamentals of algorithms and computational complexity.
AboutAbout the lab
Designing efficient procedures and clarifying the nature of problems
The Takenaga Lab conducts research on algorithms and computational complexity, which are essential in every area of computer science.
An algorithm is a procedure for processing a problem.
Even for the same task, the time required can differ, sometimes beyond comparison, depending on whether a good algorithm or an inefficient one is used.
The lab studies methods using binary decision diagrams, problems on graphs, and the computational complexity of games and puzzles.
Key terms
- Algorithm
- A procedure for processing a problem. A program is an algorithm written in a form a computer can understand
- Computational complexity
- The amount of effort an algorithm needs to solve a problem. The smaller it is, the less time is required
- Binary decision diagram
- A diagram for efficiently representing Boolean functions that take only the values 0 and 1. Also called an OBDD
ResearchResearch themes
The Takenaga Lab conducts fundamental research on algorithms and computational complexity. It aims to develop methods for designing efficient algorithms and to clarify the nature of problems.
*Illustrative imageEfficient Representations of Boolean Functions and Algorithms
The lab studies methods for designing algorithms, such as enumerating the solutions that satisfy given conditions, using ordered binary decision diagrams (OBDDs), an efficient way to represent Boolean functions. It also investigates which functions can be represented compactly.
*Illustrative imageAlgorithms for Graph Problems
Many graph problems are thought to take an enormous amount of time to solve as graphs grow large. Focusing on the fact that they are often easy to solve when limited to graphs with special properties, the lab studies the algorithms and computational complexity for graphs close to such graphs.
*Illustrative imageComputational Complexity of Games and Puzzles
Games and puzzles also include problems that are inherently hard and ones that are easy, and the lab studies how to clarify this "difficulty." It has proved that problems related to Rogue (an old RPG) and Puyo Puyo, among others, are computationally hard.
MembersFaculty
The Takenaga Lab's members consist of faculty and students in the master's program and the undergraduate level.
- Associate ProfessorYasuhiko Takenaga
VoicesStudent voices
Ratings and reviews reflect the experiences of individual current or former students, not the lab's official views. Whether a lab has reviews, or how many, says nothing about the lab itself.
Students who take part in an interview may receive a thank-you gift worth ¥1,000, regardless of what they say.
Student ratings (0 students)
--
--
--
--
--
--
Student voices answer questions like these
- What's great about this lab?
- What did you learn after joining?
- What's the vibe, and what is the professor like?
- Who is this lab for?
- Where do graduates go?
Your experience can help younger students choose their lab. Your name won't be shown.
Write a lab reviewAnonymous · Your draft is saved if you stopRelatedLabs similar to Takenaga Lab
Ito-Mieno LabSchool of Informatics and Engineering, Class I (Informatics)Discrete algorithms / discrete mathematics / recreational ma…
Okamoto LabSchool of Informatics and Engineering, Class I (Informatics)Discrete mathematics / discrete algorithms / discrete optimi…
Iwasaki LabSchool of Informatics and Engineering, Class I (Informatics)Game theory / algorithms / mechanism design / electronic com…
Koga LabSchool of Informatics and Engineering, Class I (Informatics)Fast algorithms / similarity search / big dataThe information on this page is compiled by the LabLog team from the lab's public information and interviews. For corrections or removal requests, please contact LabLog, not the lab.
Report an errorAbout the images
The top and research theme images are illustrative and were not taken at the lab. They are cropped from Wikimedia Commons images. Cropped CC BY-SA images are provided under the same CC BY-SA license as the original (version shown on each line).
- Top image: “Algorithm Tarjan” No machine-readable author provided. GifTagger assumed (based on copyright claims). / CC BY-SA 3.0 (cropped)
- Efficient Representations of Boolean Functions and Algorithms: “BDD” The original uploader was IMeowbot at English Wikipedia. / CC BY-SA 3.0 (cropped)
- Algorithms for Graph Problems: “Implication graph collision” Mbssdr / CC BY-SA 4.0 (cropped)
- Computational Complexity of Games and Puzzles: “Sudoku Puzzle (a puzzle with total symmetry)” LithiumFlash / CC BY-SA 4.0 (cropped)
- Related lab (伊藤 大雄・三重野 琢也 研究室): “Set of various puzzles” Lpele / CC BY-SA 4.0 (cropped)
- Related lab (岡本 吉央 研究室): “Voronoi colors” Bayu198 / CC0 (cropped)
- Related lab (岩﨑 敦 研究室): “Otago Farmers Market main carpark stalls 13 Dec 2025” DrThneed / CC BY 4.0 (cropped)
- Related lab (古賀 久志 研究室): “Orange-data-mining-hierarchical-clustering” Blaž Zupan (Orange Data Mining) / CC BY-SA 4.0 (cropped)
About LabLog
LabLog is a lab review app for students only. Student members at each university interview students in labs and publish what they say. Student voices can only be read by students who sign up with a university email address. Operated by bestiee Inc.
Learn more about LabLog ↗Search engines and AI may reference the basic lab info and rating summaries on this page and the description of LabLog. Student voices are for student members only. Automated collection by programs (scraping, or input to or training of AI) is prohibited under Article 8 of the Terms of Service. If you need data for research or analysis, please contact us.