• A
  • A
  • A
日本語 Help
Science and technology information site for articles, patents, researchers information, etc.
Advanced
search
ALL

Synonyms(0)

Find out more technical terms

Thesaurus Map Clips

ー



Please login to MyJ-GLOBAL to use J- GLOBAL.
Please register to create your MyJ-GLOBAL account, if you do not have one.
What is MyJ-GLOBAL?
Login Register now
Number of clips is over the max size. (Max number of Clips: 600)
Close
Reset
Go to 「How to search」 page
Advanced search: Search from
　
　Select basic information for advanced search
Free word
～
Chemical structure search
How to Search
NEW R FG i
C N O S F Cl Br I P X
JSME Molecular Editor by Peter Ertl and Bruno Bienfait
drag out MOL or RXN file
Import

MOLfile format is only available (V3000 format is not available)

              
Details
Related links
Search

Co-authoring Researcher

Co-inventing Researcher

Researcher similar to the Researcher

Article similar to the Researcher

Patent similar to the Researcher

Research Project similar to the Researcher

Article(J-GLOBAL estimation)

Patent(J-GLOBAL estimation)

Rchr
J-GLOBAL ID：202201005632065038   Update date: Feb. 05, 2025

Shimizu Nobutaka

シミズ ノブタカ | Shimizu Nobutaka
Clips
Affiliation and department：
Institute of Science Tokyo School of Engineering

About Institute of Science Tokyo School of Engineering


Job title： Assistant Professor
Homepage URL  (1)： https://sites.google.com/view/nobutaka-shimizu/home
Research theme for competitive and other funds  (4)：
  • 2024 - 2030 メタ計算量に基づく平均時NP完全性理論の開拓
  • 2023 - 2028 Complexity Lower Bounds from Expansion
  • 2021 - 2023 Community Detection Algorithm from Voting Process
  • 2018 - 2022 Computational Complexity of Minimum Description Size Problems
Papers (12)：
  • Shuichi Hirahara, Nobutaka Shimizu. Planted Clique Conjectures Are Equivalent. Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC). 2024. 358-366
  • Nobutaka Shimizu, Takeharu Shiraga. Quasi-majority functional voting on expander graphs. Random Structures & Algorithms. 2024. 65. 4. 613-643
  • Nobutaka Shimizu, Takeharu Shiraga. Reversible random walks on dynamic graphs. Random Structures & Algorithms. 2023. 63. 4. 1100-1136
  • Shuichi Hirahara, Nobutaka Shimizu. Hardness Self-Amplification: Simplified, Optimized, and Unified. Proceedings of the 55th Annual ACM Symposium on Theory of Computing (STOC). 2023
  • Shuichi Hirahara, Nobutaka Shimizu. Hardness Self-Amplification from Feasible Hard-Core Sets. Proceedings of the Symposium on Foundations of Computer Science (FOCS 2022). 2022
ｍore...
Lectures and oral presentations  (13)：
  • Planted Clique Conjectures Are Equivalent
    (Complexity Network 2024)
  • Hardness Amplification for Planted Clique Problem
    (Conceptual Challenges in AI: from ML to Average-Case Computation and Cryptography 2024)
  • Consensus Dynamics via Martingale Concentration
    (2024)
  • Expansion and Local Testability
    (2023)
  • Locally Testable Codes from Left-Right Cayley Cubical Complex
    (2023)
ｍore...
Awards (2)：
  • 2024/02 - LA/EATCS Japan Chapter LA/EATCS-Japan Presentation Award
  • 2023/01 - LA/EATCS Japan Chapter LA/EATCS-Japan Presentation Award Hardness Self-Amplification
※ Researcher’s information displayed in J-GLOBAL is based on the information registered in researchmap. For details, see here.

Return to Previous Page

TOP

BOTTOM