Rchr
J-GLOBAL ID：201501014888315418
Update date: Jul. 16, 2024
Seto Kazuhisa
セト カズヒサ | Seto Kazuhisa
Affiliation and department：
Job title：
Associate Professor
Homepage URL (1)：
https://kaken.nii.ac.jp/d/r/20584056.ja.html
Research field (1)：
Information theory
Research keywords (2)：
アルゴリズム設計論
, 計算量理論
Research theme for competitive and other funds (10)：
- 2024 - 2028 組合せ最適化問題に対する解の唯一化における計算複雑さの研究
- 2022 - 2027 超スマート社会時代のアルゴリズム工学 - パラメータ化近似均衡計算
- 2022 - 2026 列挙や数え上げなどを統一的に扱うための基盤技術
- 2021 - 2024 定数段数回路における計算限界導出技法の研究
- 2021 - 2023 強指数時間仮説に基づく計算限界の理解と探究
- 2018 - 2021 Studies toward disproving the strong exponential time hypothesis
- 2014 - 2017 On Algorithmic Approaches to Proving Circuit Lower Bounds
- 2012 - 2017 Studies on Limits of Computation via Information and Coding Theory
- 2013 - 2016 Approximate Computing to Cope with Imperfect Information from Growing Data Size
- 2010 - 2011 Development of Grapy Theoretical Analysis for Proof Complexity
Show all
Papers (26)：
-
Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama. Shortest Cover After Edit. CPM. 2024. 24-15
-
Yuki Kawakami, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama, Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh. Lower Bounds for the Thickness and the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs and (2,2)-Tight Graphs. IEICE Trans. Inf. Syst. 2024. 107. 6. 732-740
-
Takashi Horiyama, Yasuaki Kobayashi, Hirotaka Ono 0001, Kazuhisa Seto, Ryu Suzuki. Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover. AAAI. 2024. 20726-20734
-
Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama. Finding top-k longest palindromes in substrings. Theoretical Computer Science. 2023. 979. 114183-114183
-
Yuki Kawakami, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama, Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh. Lower Bounds for the Thickness and the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs and (2,2)-Tight Graphs. CCCG. 2023. 191-196
ｍore...
MISC (16)：
-
Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno. Optimal LZ-End Parsing is Hard. CoRR. 2023. abs/2302.02586
-
Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama. Internal Longest Palindrome Queries in Optimal Time. CoRR. 2022. abs/2210.02000. 127-138
-
IUCHI Katsuya, NISHIO Yu, SETO Kazuhisa, OGAWA Takanobu. Effectiveness of an On-demand Online Course in Information Science for First-year Science and Engineering Students. Journal of the Japan Association for Developmental Education. 2022. 16. 25. 161-167
-
脊戸 和寿. コンピュテーション研究会 近況報告. 情報・システムソサイエティ誌. 2018. 23. 3. 8-9
-
清水 堅斗, 三觜 辰也, 脊戸 和寿. Improved Analysis of Greedy Algorithm for Sorting k-Sets in Bins. 電子情報通信学会技術研究報告 = IEICE technical report : 信学技報. 2017. 116. 503. 29-32
ｍore...
Lectures and oral presentations (2)：
-
多数決関数の計算複雑さと未解決問題について
(電子情報通信学会コンピュテーション研究会 2022)
-
A Moderately Exponential Time Satisfiability Algorithm for Linear-Sized Deterministic Width-2 Branching Programs
(電子情報通信学会コンピュテーション研究会 2022)
Professional career (1)：
Work history (6)：
Association Membership(s) (1)：
THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS
