Seto Kazuhisa 脊戸和寿

… Alternative Names

SETO Kazuhisa 脊戸和寿

Less

Researcher Number	20584056
Other IDs
Affiliation (Current)	2025: 北海道大学, 情報科学研究院, 准教授
Affiliation (based on the past Project Information) *help	2020 – 2024: 北海道大学, 情報科学研究院, 准教授 2018 – 2019: 成蹊大学, 理工学部, 准教授 2015 – 2016: 成蹊大学, 理工学部, 講師 2015: 成蹊大学, 理工学部情報科学科, 講師 2014: 成蹊大学, 理工学部, 助教 2010 – 2011: 京都大学, 情報学研究科, 特定研究員
Review Section/Research Field	Principal Investigator Basic Section 60010:Theory of informatics-related / Sections That Are Subject to Joint Review: Basic Section60010:Theory of informatics-related , Basic Section60020:Mathematical informatics-related / Basic Section 60020:Mathematical informatics-related / Transformative Research Areas, Section (IV) / Theory of informatics / Fundamental theory of informatics Except Principal Investigator Basic Section 60010:Theory of informatics-related / Medium-sized Section 60:Information science, computer engineering, and related fields / Theory of informatics / Science and Engineering
Keywords	Principal Investigator 充足可能性問題 / 計算量理論 / 強指数時間仮説 / 厳密アルゴリズム / 分岐プログラム / 回路計算量 / パラメータ化アルゴリズム / 計算複雑性 / 組合せ最適化問題 / 解の唯一化 … More / SATアルゴリズム / 下界証明 / 二元体上の連立線形方程式 / 多数決関数 / 定数段数回路 / 解空間の連結性判定 / k-Horn式 / 3段回路 / Depth-3 Circuit / Branching Program / Bounded Width / Satisfiability / 計算限界 / LZ分解 / NP困難 / 指数時間仮説 / 幅限定 / 置換分岐プログラム / 幅限定分岐プログラム / 充足可能性判定 / 最大充足可能性問題 / 論理回路 / 閾値回路 / 彩色問題 / 列挙 / Hajos Calculus / 証明複雑さ / グラフ理論 … More Except Principal Investigator アルゴリズム / 計算モデル / 離散構造 / サンプリングアルゴリズム / 数え上げアルゴリズム / 列挙アルゴリズム / PSPACE完全 / 近似アルゴリズム / パラメータ化計算量 / 多項式階層 / グラフ最適化 / 局所構造 / パラメータ化アルゴリズム / 均衡計算 / 組合せ最適化 / 理論的性能保証 / 数理モデル化 / 情報の補填 / 計算困難問題 / グラフアルゴリズム / 調和解析 / 劣線形時間 / 定数時間 / 離散アルゴリズム / 計算量理論 / グラフ / 性質検査 / 劣線形時間計算 / 定数時間検査 / 制約充足問題 / グラフ彩色 / 理論計算機科学 / 計算理論 Less

組合せ最適化問題に対する解の唯一化における計算複雑さの研究Principal Investigator
- Principal Investigator
  
  脊戸和寿
- Project Period (FY)
  2024 – 2027
- Research Category
  
  Grant-in-Aid for Scientific Research (B)
- Review Section
  
  Basic Section 60010:Theory of informatics-related
  Basic Section 60020:Mathematical informatics-related
  Sections That Are Subject to Joint Review: Basic Section60010:Theory of informatics-related , Basic Section60020:Mathematical informatics-related
- Research Institution
  Hokkaido University
超スマート社会時代のアルゴリズム工学 - パラメータ化近似均衡計算
- Principal Investigator
  
  小野廣隆
- Project Period (FY)
  2022 – 2026
- Research Category
  
  Grant-in-Aid for Scientific Research (A)
- Review Section
  
  Medium-sized Section 60:Information science, computer engineering, and related fields
- Research Institution
  Nagoya University
列挙や数え上げなどを統一的に扱うための基盤技術
- Principal Investigator
  
  堀山貴史
- Project Period (FY)
  2022 – 2025
- Research Category
  
  Grant-in-Aid for Scientific Research (B)
- Review Section
  
  Basic Section 60010:Theory of informatics-related
- Research Institution
  Hokkaido University
強指数時間仮説に基づく計算限界の理解と探究Principal Investigator
- Principal Investigator
  
  脊戸和寿
- Project Period (FY)
  2021 – 2022
- Research Category
  
  Grant-in-Aid for Transformative Research Areas (A)
- Review Section
  
  Transformative Research Areas, Section (IV)
- Research Institution
  Hokkaido University
Research on Proof Techniques for Lower Bounds on Constant Depth CircuitsPrincipal Investigator
- Principal Investigator
  
  Kazuhisa Seto
- Project Period (FY)
  2021 – 2023
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Review Section
  
  Basic Section 60010:Theory of informatics-related
- Research Institution
  Hokkaido University
Studies toward disproving the strong exponential time hypothesisPrincipal Investigator
- Principal Investigator
  
  Seto Kazuhisa
- Project Period (FY)
  2018 – 2021
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Review Section
  
  Basic Section 60010:Theory of informatics-related
- Research Institution
  Hokkaido University
  Seikei University
On Algorithmic Approaches to Proving Circuit Lower BoundsPrincipal Investigator
- Principal Investigator
  
  Seto Kazuhisa
- Project Period (FY)
  2014 – 2016
- Research Category
  
  Grant-in-Aid for Young Scientists (B)
- Research Field
  
  Theory of informatics
- Research Institution
  Seikei University
Approximate Computing to Cope with Imperfect Information from Growing Data Size
- Principal Investigator
  
  IWAMA KAZUO
- Project Period (FY)
  2013 – 2015
- Research Category
  
  Grant-in-Aid for Scientific Research (A)
- Research Field
  
  Theory of informatics
- Research Institution
  Kyoto University
Studies on Limits of Computation via Information and Coding Theory
- Principal Investigator
  
  Kawarabayashi Kenichi
- Project Period (FY)
  2012 – 2016
- Research Category
  
  Grant-in-Aid for Scientific Research on Innovative Areas (Research in a proposed research area)
- Review Section
  
  Science and Engineering
- Research Institution
  National Institute of Informatics
Development of Grapy Theoretical Analysis for Proof ComplexityPrincipal Investigator
- Principal Investigator
  
  SETO Kazuhisa
- Project Period (FY)
  2010 – 2011
- Research Category
  
  Grant-in-Aid for Research Activity Start-up
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  Kyoto University

All 2024 2023 2022 2020 2019 2016 2015 2014 2013 2012 2010 Other

All Journal Article Presentation

[Journal Article] Finding top-k longest palindromes in substrings2023
- Author(s)
  Mitani Kazuki、Mieno Takuya、Seto Kazuhisa、Horiyama Takashi
- Journal Title
  
  Theoretical Computer Science
  
  Volume: 979 Pages: 114183-114183
- DOI
  10.1016/j.tcs.2023.114183
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22K21273, KAKENHI-PLANNED-20H05964, KAKENHI-PUBLICLY-23H04381, KAKENHI-PROJECT-23K24806
[Journal Article] Internal Longest Palindrome Queries in Optimal Time2023
- Author(s)
  Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, and Takashi Horiyama
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 13973 Pages: 127-138
- DOI
  10.1007/978-3-031-27051-2_12
- ISBN
  9783031270505, 9783031270512
- Peer Reviewed
- Data Source
  KAKENHI-PUBLICLY-21H05839
[Journal Article] Optimal LZ-End Parsing is Hard2023
- Author(s)
  Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, and Takeaki Uno
- Journal Title
  
  Leibniz International Proceedings in Informatics
  
  Volume: 259
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PUBLICLY-21H05839
[Journal Article] A Satisfiability Algorithm for Deterministic Width-2 Branching Programs2022
- Author(s)
  Tomu MAKITA, Atsuki NAGAO, Tatsuki OKADA, Kazuhisa SETO, Junichi TERUYAMA
- Journal Title
  
  IEICE Trans. Fundamentals
  
  Volume: E105.A Issue: 9 Pages: 1298-1308
- DOI
  10.1587/transfun.2021EAP1120
- ISSN
  0916-8508, 1745-1337
- Year and Date
  2022-09-01
- Language
  English
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-18K11170, KAKENHI-PUBLICLY-21H05839, KAKENHI-PROJECT-21K11743, KAKENHI-PROJECT-20K19741, KAKENHI-PROJECT-22K11910, KAKENHI-PROJECT-18K18003, KAKENHI-PLANNED-20H05794
[Journal Article] Fair Ride Allocation on a Line2022
- Author(s)
  Yuki Amano, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hirotaka Ono
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 13584 Pages: 421-435
- DOI
  10.1007/978-3-031-15714-1_24
- ISBN
  9783031157134, 9783031157141
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-19K22841, KAKENHI-PROJECT-20K19739, KAKENHI-PLANNED-20H05967, KAKENHI-PROJECT-20H00609, KAKENHI-PROJECT-22H00513
[Journal Article] Reallocation Problems with Minimum Completion Time2022
- Author(s)
  Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino, Hirotaka Ono
- Journal Title
  
  Proceedings of the 28th International Conference on Computing and Combinatorics, COCOON 2022
  
  Volume: - Pages: 292-304
- DOI
  10.1007/978-3-031-22105-7_26
- ISBN
  9783031221040, 9783031221057
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-16K00001, KAKENHI-PROJECT-19K22841, KAKENHI-PROJECT-21K19765, KAKENHI-PLANNED-20H05967, KAKENHI-PLANNED-20H05794, KAKENHI-PROJECT-22H00513
[Journal Article] Satisfiability Algorithm for Syntactic Read-k-times Branching Programs2020
- Author(s)
  Atsuki Nagao, Kazuhisa Seto, and Junichi Teruyama
- Journal Title
  
  Theory of Computing Systems
  
  Volume: 64 Issue: 8 Pages: 1392-1407
- DOI
  10.1007/s00224-020-09996-3
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-18K11170, KAKENHI-PROJECT-18K18003, KAKENHI-PROJECT-20K19741
[Journal Article] Bounded depth circuits with weighted symmetric gates: Satisfiability, lower bounds and compression2019
- Author(s)
  Sakai Takayuki、Seto Kazuhisa、Tamaki Suguru、Teruyama Junichi
- Journal Title
  
  Journal of Computer and System Sciences
  
  Volume: 印刷中 Pages: 87-103
- DOI
  10.1016/j.jcss.2019.04.004
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18K11164, KAKENHI-PROJECT-18K11170, KAKENHI-PROJECT-18K18003, KAKENHI-PROJECT-18H04090
[Journal Article] An Exact Algorithm for Oblivious Read-Twice Branching Program Satisfiability2016
- Author(s)
  Kazuhisa Seto and Junichi Teruyama
- Journal Title
  
  IEICE Trans. Fundamentals
  
  Volume: E99.A Issue: 6 Pages: 1019-1024
- DOI
  10.1587/transfun.E99.A.1019
- NAID
  130005154212
- ISSN
  0916-8508, 1745-1337
- Language
  English
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PROJECT-26730007
[Journal Article] Efficient Algorithms for Sorting k-Sets in Bins2015
- Author(s)
  Atsuki Nagao, Kazuhisa Seto and Junichi Teruyama
- Journal Title
  
  IEICE Transactions on Information and Systems
  
  Volume: E98-D(10)
- NAID
  130005101307
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PLANNED-24106003
[Journal Article] An Introduction to Lower Bounds on Resolution Proof Systems2015
- Author(s)
  Kazuhisa Seto
- Journal Title
  
  IIS
  
  Volume: 21 Issue: 4 Pages: 307-328
- DOI
  10.4036/iis.2015.L.02
- NAID
  110009992968
- ISSN
  1340-9050, 1347-6157
- Language
  English
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-26730007, KAKENHI-PLANNED-24106003
[Journal Article] Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction2015
- Author(s)
  Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki
- Journal Title
  
  Theory Comput. Syst.
  
  Volume: 57(2) Issue: 2 Pages: 426-443
- DOI
  10.1007/s00224-014-9600-6
- Peer Reviewed / Acknowledgement Compliant / Open Access
- Data Source
  KAKENHI-PROJECT-26330011, KAKENHI-PROJECT-26730007, KAKENHI-PLANNED-24106003
[Journal Article] Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction2014
- Author(s)
  Takayuki Sakai, Kazuhisa Seto, and Suguru Tamaki
- Journal Title
  
  Theory and Applications of Satisfiability Testing (SAT 2014)
  
  Volume: 8561 Pages: 32-47
- DOI
  10.1007/978-3-319-09284-3_4
- NAID
  120005576220
- ISBN
  9783319092836, 9783319092843
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PROJECT-26730007
[Journal Article] Derandomizing HSSW Algorithm for 3-SAT2013
- Author(s)
  Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
- Journal Title
  
  Algorithmica
  
  Volume: 未定 Issue: 2 Pages: 112-124
- DOI
  10.1007/s00453-012-9741-4
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22240001, KAKENHI-PROJECT-22500007, KAKENHI-PROJECT-23700015, KAKENHI-PLANNED-24106002, KAKENHI-PLANNED-24106003, KAKENHI-PROJECT-25240002
[Journal Article] A satisfiability algorithm and average-case hardness for formulas over the full binary basis2013
- Author(s)
  Kazuhisa Seto, Suguru Tamaki
- Journal Title
  
  Computational Complexity
  
  Volume: 22(2) Issue: 2 Pages: 245-274
- DOI
  10.1007/s00037-013-0067-7
- NAID
  120005474485
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22240001, KAKENHI-PLANNED-24106003, KAKENHI-PROJECT-25240002
[Journal Article] A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis2012
- Author(s)
  K.Seto, S.Tamaki
- Journal Title
  
  Proceedings of the 27th IEEE Conference on Computational Complexity
  
  Volume: (to appear)
- NAID
  110009588450
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22800033
[Journal Article] Improved Randomized Algorithms for 3-SAT2010
- Author(s)
  K.Iwama, K.Seto, T.Takai, S.Tamaki
- Journal Title
  
  Proceedings of the 21^<st> International Symposium on Algorithms and Computation, LNCS
  
  Volume: 6506 Pages: 73-84
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22800033
[Journal Article] The Planar Hajos Calculus for Bounded Degree Graphs2010
- Author(s)
  K. Iwama, K. Seto and S. Tamaki.
- Journal Title
  
  IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
  
  Volume: E93-A(6) Pages: 1000-1007
- NAID
  10026864512
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22800033
[Presentation] フィボナッチ文字列中の極大αギャップ付き反復の個数の上界2024
- Author(s)
  山根和真, 中島祐人, 脊戸和寿, 堀山貴史
- Organizer
  LA シンポジウム
- Data Source
  KAKENHI-PROJECT-23K24806
[Presentation] Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover2024
- Author(s)
  T. Horiyama, Y. Kobayashi, H. Ono, K. Seto, R. Suzuki
- Organizer
  The 38th Annual AAAI Conference on Artificial Intelligence
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-23K24806
[Presentation] ZDD を用いた最適円筒あみだくじの列挙2023
- Author(s)
  岩崎善泰, 堀山貴史, 松井泰子, 野崎雄太, 脊戸和寿, 山中克久
- Organizer
  情報処理学会アルゴリズム研究会
- Data Source
  KAKENHI-PROJECT-23K24806
[Presentation] NP-completeness of Computing Pre-assignments to Uniquify Vertex Cover for Bipartite Graphs2023
- Author(s)
  Ryu Suzuki, Yasuaki Kobayashi, Kazuhisa Seto, Takashi Horiyama
- Organizer
  The 23rd Japan?Korea Joint Workshop?on Algorithms and Computation
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-22H00513
[Presentation] Optimal LZ-End Parsing is Hard2023
- Author(s)
  Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, and Takeaki Uno
- Organizer
  The 34th Annual Symposium on Combinatorial Pattern Matching
- Int'l Joint Research
- Data Source
  KAKENHI-PUBLICLY-21H05839
[Presentation] 平面上の最小重み無交差 Laman グラフと関連する幾何的グラフについて2023
- Author(s)
  河上悠輝, 脊戸和寿, 堀山貴史, 小林祐貴, 東川雄哉, 加藤直樹
- Organizer
  LA シンポジウム
- Data Source
  KAKENHI-PROJECT-23K24806
[Presentation] Hardness of Computing a Pre-assignment to Uniquify Minimum Dominating?Sets?on?Bipartite?Graphs2023
- Author(s)
  鈴木琉, 脊戸和寿, 堀山貴史
- Organizer
  第195回アルゴリズム研究発表会
- Data Source
  KAKENHI-PROJECT-22H00513
[Presentation] Lower Bounds for the Thickness and the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs and (2,2)-Tight Graphs2023
- Author(s)
  Y. Kawakami, S. Takahashi, K. Seto, T. Horiyama, Y. Kobayashi, Y. Higashikawa, N. Katoh
- Organizer
  The 35th Canadian Conference on Computational Geometry
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-23K24806
[Presentation] Enumeration of Non-isomorphic Unordered Trees with Degree Sequence Constraints2023
- Author(s)
  S. Denzumi, T. Horiyama, K. Kurita, A. Nagao, K. Seto, K. Wasa
- Organizer
  情報処理学会, アルゴリズム研究会
- Data Source
  KAKENHI-PROJECT-23K24806
[Presentation] フィボナッチ文字列中の極大ギャップ付き反復の個数2023
- Author(s)
  山根和真, 中島祐人, 脊戸和寿, 堀山貴史
- Organizer
  LA シンポジウム
- Data Source
  KAKENHI-PROJECT-23K24806
[Presentation] Optimal LZ-End Parsing is Hard2023
- Author(s)
  H. Bannai, M. Funakoshi, K. Kurita, Y. Nakashima, K. Seto, T. Uno
- Organizer
  The 34th Annual Symposium on Combinatorial Pattern Matching
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-23K24806
[Presentation] NP-completeness of Computing Pre-assignments to Uniquify Vertex Cover for Bipartite Graphs2023
- Author(s)
  R. Suzuki, Y. Kobayashi, K. Seto, T. Horiyama
- Organizer
  LA シンポジウム
- Data Source
  KAKENHI-PROJECT-23K24806
[Presentation] Internal Longest Palindrome Queries in Optimal Time2023
- Author(s)
  Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, and Takashi Horiyama
- Organizer
  The 17th International Conference and Workshops on Algorithms and Computation
- Int'l Joint Research
- Data Source
  KAKENHI-PUBLICLY-21H05839
[Presentation] Hardness of Computing a Pre-assignment to Uniquify Minimum Dominating Sets on Bipartite Graphs2023
- Author(s)
  R. Suzuki, K. Seto, T. Horiyama
- Organizer
  情報処理学会, アルゴリズム研究会
- Data Source
  KAKENHI-PROJECT-23K24806
[Presentation] Internal Longest Palindrome Queries in Optimal Time2023
- Author(s)
  K. Mitani, T. Mieno, K. Seto, T. Horiyama
- Organizer
  The 14th International Conference and Workshops on Algorithms and Computation
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-23K24806
[Presentation] 区間最長回文クエリに対する時間最適アルゴリズム2022
- Author(s)
  三谷和暉, 脊戸和寿, 堀山貴史, 三重野琢也
- Organizer
  STR セミナー
- Data Source
  KAKENHI-PROJECT-23K24806
[Presentation] 最小重み Laman グラフの総交点数と厚みの下界の改良2022
- Author(s)
  河上悠輝, 高橋駿, 脊戸和寿, 堀山貴史, 小林祐貴, 東川雄哉, 加藤直樹
- Organizer
  第35 回回路とシステムワークショップ
- Data Source
  KAKENHI-PROJECT-23K24806
[Presentation] 文字列中の異なる閉文字列の数え上げと最大個数について2022
- Author(s)
  高橋駿, 脊戸和寿, 堀山貴史, 三重野琢也
- Organizer
  STR セミナー
- Data Source
  KAKENHI-PROJECT-23K24806
[Presentation] 自己同型写像の断片を用いた代表元の反復抽出による同型性の除去2022
- Author(s)
  高橋孔平, 脊戸和寿, 堀山貴史
- Organizer
  電子情報通信学会コンピュテーション研究会
- Data Source
  KAKENHI-PROJECT-23K24806
[Presentation] 多数決関数の計算複雑さと未解決問題について2022
- Author(s)
  脊戸和寿
- Organizer
  電子情報通信学会コンピュテーション研究会
- Data Source
  KAKENHI-PROJECT-21K11743
[Presentation] 区間最長回文クエリに対する時間最適アルゴリズム2022
- Author(s)
  三谷和暉, 脊戸和寿, 堀山貴史, 三重野琢也
- Organizer
  2022年度夏のLA シンポジウム
- Data Source
  KAKENHI-PROJECT-23K24806
[Presentation] A Moderately Exponential Time Satisfiability Algorithm for Linear-Sized Deterministic Width-2 Branching Programs2022
- Author(s)
  Tomu Makita, Atsuki Nagao, Tatsuki Okada, Kazuhisa Seto, and Junichi Teruyama
- Organizer
  電子情報通信学会コンピュテーション研究会
- Data Source
  KAKENHI-PROJECT-21K11743
[Presentation] 文字列中の異なる閉文字列の数え上げと最大個数について2022
- Author(s)
  高橋駿, 脊戸和寿, 堀山貴史, 三重野琢也
- Organizer
  2022年度夏のLA シンポジウム
- Data Source
  KAKENHI-PROJECT-23K24806
[Presentation] 最小重み Laman グラフの総交点数と厚みの下界の改良2022
- Author(s)
  河上悠輝, 高橋駿, 脊戸和寿, 堀山貴史, 小林祐貴, 東川雄哉, 加藤直樹
- Organizer
  2022年度夏のLA シンポジウム
- Data Source
  KAKENHI-PROJECT-23K24806
[Presentation] Counting and ZDDbased Enumeration of Locally Flat-Foldable Box-Pleated Crease Patterns on the 45-Degree Grid System2022
- Author(s)
  Y. Enomoto, Y. Kawakami, K. Seto, T. Horiyama, J. Mitani
- Organizer
  The 5th International Workshop on Enumeration Problems & Applications
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-23K24806
[Presentation] Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression2016
- Author(s)
  Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki and Junichi Teruyama
- Organizer
  The 41st International Symposium on Mathematical Foundations of Computer Science
- Place of Presentation
  Krakow, Poland
- Year and Date
  2016-08-22
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-26730007
[Presentation] Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction2015
- Author(s)
  Kazuhisa Seto
- Organizer
  The 7nd Annual Meeting of Asian Association for Algorithms and Computation (AAAC)
- Place of Presentation
  Hiroshima(Japan)
- Year and Date
  2015-05-09
- Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-24106003
[Presentation] A Moderately Exponential Time Algorithm for k-IBDD Satisfiability2015
- Author(s)
  Atsuki Nagao, Kazuhisa Seto and Junichi Teruyama
- Organizer
  The 14th Workshop on Algorithms and Data Structures
- Place of Presentation
  Victoria, Canada
- Year and Date
  2015-08-05
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-26730007
[Presentation] Improved Exact Algorithms for Mildly Sparse Instances of Max SAT2015
- Author(s)
  Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki and Junichi Teruyama
- Organizer
  The 10th International Symposium on Parameterized and Exact Computation
- Place of Presentation
  Patras, Greece
- Year and Date
  2015-09-16
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-26730007
[Presentation] 線形サイズ$k$-IBDD充足可能性問題に対する厳密アルゴリズム2015
- Author(s)
  脊戸和寿，照山順一，長尾篤樹
- Organizer
  第152回アルゴリズム研究会
- Place of Presentation
  東京都，電気通信大学
- Year and Date
  2015-03-03
- Data Source
  KAKENHI-PLANNED-24106003
[Presentation] Improved Exact Algorithms for Mildly Sparse Instances of Max SAT2015
- Author(s)
  Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama
- Organizer
  IPEC 2015
- Place of Presentation
  Patras, Greece
- Year and Date
  2015-09-16
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-25240002
[Presentation] Efficient Algorithms for Sorting k-Sets in Bins2014
- Author(s)
  Atsuki Nagao, Kazuhisa Seto and Junichi Teruyama
- Organizer
  WALCOM 2014
- Place of Presentation
  Chennai, India
- Data Source
  KAKENHI-PLANNED-24106003
[Presentation] A Satisfiability Algorithm for Formulas over the Full Binary Basis.2012
- Author(s)
  K. Seto and S. Tamaki. K. Seto and S. Tamaki. K. Seto and S. Tamaki.
- Organizer
  RIMS研究集会「アルゴリズムと計算理論の新展開」(冬のLAシンポジウム)予稿
- Place of Presentation
  Kyoto, Japan
- Data Source
  KAKENHI-PROJECT-22800033
[Presentation] A Satisfiability Algorithm for Formulas over the Full Binary Basis2012
- Author(s)
  K.Seto, S.Tamaki
- Organizer
  RIMS研究集会「アルゴリズムと計算理論の新展開」(冬のLAシンポジウム)
- Place of Presentation
  京都大学
- Year and Date
  2012-10-30
- Data Source
  KAKENHI-PROJECT-22800033
[Presentation] A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis.2012
- Author(s)
  K. Seto and S. Tamaki.
- Organizer
  In proceedings of the 27th IEE Conference on Computational Complexity
- Place of Presentation
  Porto, Portugal(to appear)
- Data Source
  KAKENHI-PROJECT-22800033
[Presentation] Improved Randomized Algorithms for 3-SAT.2010
- Author(s)
  K. Iwama, K. Seto, T. Takai and S. Tamaki.
- Organizer
  In proceedings of the 21st International Symposium on Algorithms and ComputatioS
- Place of Presentation
  Jeju, Korea.
- Data Source
  KAKENHI-PROJECT-22800033
[Presentation] Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction
- Author(s)
  Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki
- Organizer
  SAT 2014
- Place of Presentation
  Vienna, Austria
- Year and Date
  2014-07-14 – 2014-07-17
- Data Source
  KAKENHI-PROJECT-25240002
[Presentation] Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction
- Author(s)
  Takayuki Sakai, Kazuhisa Seto, and Suguru Tamaki
- Organizer
  The 17th International Conference on Theory and Applications of Satisfiability Testing
- Place of Presentation
  Vienna, Austria
- Year and Date
  2014-07-14 – 2014-07-17
- Data Source
  KAKENHI-PROJECT-26730007

1. 長尾篤樹 (20802622)

# of Collaborated Projects: 3 results

# of Collaborated Products: 2 results
2. TAMAKI Suguru (40432413)

# of Collaborated Projects: 2 results

# of Collaborated Products: 6 results
3. ITO Hiro (50283487)

# of Collaborated Projects: 2 results

# of Collaborated Products: 0 results
4. YOSHIDA Yuichi (50636967)

# of Collaborated Projects: 2 results

# of Collaborated Products: 0 results
5. HORIYAMA Takashi (60314530)

# of Collaborated Projects: 2 results

# of Collaborated Products: 18 results
6. 小野廣隆 (00346826)

# of Collaborated Projects: 2 results

# of Collaborated Products: 0 results
7. Kawarabayashi Kenichi (40361159)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
8. IWAMA KAZUO (50131272)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
9. AVIS David (90584110)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
10. MIYAZAKI Shuichi (00303884)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
11. OKAMOTO Kazuya (60565018)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
12. KAWAHARA JUN (20572473)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
13. 上野賢哉 (70586081)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
14. 柳浦睦憲 (10263120)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
15. 大舘陽太 (80610196)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
16. 土中哲秀 (30824982)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
17. 伝住周平 (90755729)

# of Collaborated Projects: 1 results

# of Collaborated Products: 1 results
18. 和佐州洋 (00781337)

# of Collaborated Projects: 1 results

# of Collaborated Products: 1 results
19. 栗田和宏 (40885266)

# of Collaborated Projects: 1 results

# of Collaborated Products: 2 results
20. 中畑裕 (50942067)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
21. 牧野和久

# of Collaborated Projects: 0 results

# of Collaborated Products: 1 results
22. 三重野琢也

# of Collaborated Projects: 0 results

# of Collaborated Products: 1 results
23. 石井利昌

# of Collaborated Projects: 0 results

# of Collaborated Products: 1 results

Seto Kazuhisa 脊戸 和寿

SETO Kazuhisa 脊戸 和寿

Research Projects

Research Products

Co-Researchers

組合せ最適化問題に対する解の唯一化における計算複雑さの研究Principal Investigator

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

超スマート社会時代のアルゴリズム工学 - パラメータ化近似均衡計算

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

列挙や数え上げなどを統一的に扱うための基盤技術

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

強指数時間仮説に基づく計算限界の理解と探究Principal Investigator

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

Research on Proof Techniques for Lower Bounds on Constant Depth CircuitsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

Studies toward disproving the strong exponential time hypothesisPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

On Algorithmic Approaches to Proving Circuit Lower BoundsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Approximate Computing to Cope with Imperfect Information from Growing Data Size

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Studies on Limits of Computation via Information and Coding Theory

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

Development of Grapy Theoretical Analysis for Proof ComplexityPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

[Journal Article] Finding top-k longest palindromes in substrings2023

Author(s)

Journal Title

DOI

Data Source

[Journal Article] Internal Longest Palindrome Queries in Optimal Time2023

Author(s)

Journal Title

DOI

ISBN

Data Source

[Journal Article] Optimal LZ-End Parsing is Hard2023

Author(s)

Journal Title

Data Source

Seto Kazuhisa 脊戸和寿

SETO Kazuhisa 脊戸和寿