Tamaki Suguru 玉置卓

… Alternative Names

TAMAKI Suguru 玉置卓

Less

Researcher Number	40432413
Other IDs
Affiliation (Current)	2025: 兵庫県立大学, 情報科学研究科, 教授 2025: 兵庫県立大学, 社会情報科学部, 教授
Affiliation (based on the past Project Information) *help	2019 – 2024: 兵庫県立大学, 社会情報科学部, 准教授 2022 – 2023: 兵庫県立大学, 情報科学研究科, 准教授 2022: 兵庫県立大学, 大学院情報科学研究科, 准教授 2021: 京都大学, 情報学研究科, 助教 2008 – 2018: Kyoto University, 情報学研究科, 助教
Review Section/Research Field	Principal Investigator Basic Section 60010:Theory of informatics-related / Fundamental theory of informatics / Theory of informatics Except Principal Investigator Transformative Research Areas, Section (IV) / Theory of informatics / Fundamental theory of informatics / Medium-sized Section 60:Information science, computer engineering, and related fields / Science and Engineering
Keywords	Principal Investigator 充足可能性問題 / 厳密アルゴリズム / 制約充足問題 / 計算困難 / 近似アルゴリズム / 量子計算 / 証明の複雑さ / グラフ理論 / 彩色問題 / 計算困難性 … More / アルゴリズム理論 / 計算量理論 / 計算限界 / アルゴリズム / 計算複雑性 / 指数時間アルゴリズム / グラフ / 論理回路 / アルゴリズム論 … More Except Principal Investigator アルゴリズム / 数理モデル化 / 情報の補填 / 計算困難問題 / 理論的性能保証 / 計算量理論 / 乱化アルゴリズム / 劣線形時間 / 性質検査 / アルゴリズム理論 / データ構造 / アルゴリズム論 / 研究推進 / 組織運営 / 革新的アルゴリズム基盤 / 量子計算の基礎 / SAT問題 / 質問計算量 / 回路計算量 / 最小回路サイズ問題 / 情報セキュリティ技術 / 情報セキュリティ / 学習可能性 / 平均時計算量 / Ｐ≠ＮＰ予想 / 機械学習 / PAC学習困難性 / 計算論的暗号 / 平均時計算困難性 / 多項式時間階層 / 最小記述量計算 / 一方向関数 / 学習計算困難さ / 平均時計算複雑度 / 最小記述量 / 計算論的暗号理論 / 計算論的学習理論 / 平均時時間計算量 / 最悪時時間計算量 / メタ計算 / P≠NP予想 / 最小記述量計算問題 / 計算複雑度理論 / ソーティング / 計算量の下限 / 平均計算量 / 平均解析 / 乱拓計算 / 乱化技術 / アルゴリズムの設計と解析 / 空間計算量 / ハノイの塔 / 競合比解析 / 乱択アルゴリズム / オンラインアルゴリズム / グラフアルゴリズム / 調和解析 / 定数時間 / 離散アルゴリズム / グラフ / 劣線形時間計算 / 定数時間検査 / 制約充足問題 / グラフ彩色 / 理論計算機科学 / 計算理論 / 准線形時間 / 分散アルゴリズム / 乱化計算 / アルゴリズム的ゲーム理論 / グラフ問題 / 確率アルゴリズム / ロバスト計算 Less

制約充足問題の新しい系統的な研究Principal Investigator
- Principal Investigator
  
  玉置卓
- Project Period (FY)
  2022 – 2025
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Review Section
  
  Basic Section 60010:Theory of informatics-related
- Research Institution
  University of Hyogo
Research Initiatives on Algorithmic Foundations for Social Advancement
- Principal Investigator
  
  湊真一
- Project Period (FY)
  2020 – 2024
- Research Category
  
  Grant-in-Aid for Transformative Research Areas (A)
- Review Section
  
  Transformative Research Areas, Section (IV)
- Research Institution
  Kyoto University
アルゴリズム基礎理論の追究・発展
- Principal Investigator
  
  牧野和久
- Project Period (FY)
  2020 – 2024
- Research Category
  
  Grant-in-Aid for Transformative Research Areas (A)
- Review Section
  
  Transformative Research Areas, Section (IV)
- Research Institution
  Kyoto University
Algorithms for Constraint Satisfaction Problems: Deepening and New DirectionsPrincipal Investigator
- Principal Investigator
  
  Tamaki Suguru
- Project Period (FY)
  2018 – 2022
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Review Section
  
  Basic Section 60010:Theory of informatics-related
- Research Institution
  University of Hyogo
  Kyoto University
Computational Complexity of Minimum Description Size Problems
- Principal Investigator
  
  Watanabe Osamu
- Project Period (FY)
  2018 – 2021
- Research Category
  
  Grant-in-Aid for Scientific Research (A)
- Review Section
  
  Medium-sized Section 60:Information science, computer engineering, and related fields
- Research Institution
  Tokyo Institute of Technology
Randomization technologies for algorithms taking incomplete inputs
- Principal Investigator
  
  Iwama Kazuo
- Project Period (FY)
  2016 – 2020
- Research Category
  
  Grant-in-Aid for Scientific Research (B)
- Research Field
  
  Theory of informatics
- Research Institution
  Kyoto University
Studies on efficient exact and approximation algorithms for constraint satisfaction problemsPrincipal Investigator
- Principal Investigator
  
  Tamaki Suguru
- Project Period (FY)
  2014 – 2017
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Theory of informatics
- Research Institution
  Kyoto 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
Studies on Exact Exponential Time Algorithms for Computationally Intractable ProblemsPrincipal Investigator
- Principal Investigator
  
  TAMAKI SUGURU
- Project Period (FY)
  2011 – 2013
- Research Category
  
  Grant-in-Aid for Young Scientists (B)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  Kyoto University
Studies on Algorithms for Insufficient Spatial Information
- Principal Investigator
  
  IWAMA Kazuo
- Project Period (FY)
  2010 – 2012
- Research Category
  
  Grant-in-Aid for Scientific Research (A)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  Kyoto University
Design and Analysis of Algorithms for Computationally Intractable Combinatorial ProblemsPrincipal Investigator
- Principal Investigator
  
  TAMAKI Suguru
- Project Period (FY)
  2008 – 2010
- Research Category
  
  Grant-in-Aid for Young Scientists (B)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  Kyoto University
Design and Analysis of Algorithms for Insufficient Information
- Principal Investigator
  
  IWAMA Kazuo
- Project Period (FY)
  2007 – 2009
- Research Category
  
  Grant-in-Aid for Scientific Research (A)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  Kyoto University

[Book] 理論計算機科学事典2022
- Author(s)
  徳山豪, 小林直樹 (総編集), 玉置卓 (3.5節)
- Total Pages
  800
- Publisher
  朝倉書店
- ISBN
  9784254122633
- Data Source
  KAKENHI-PROJECT-18K11164
[Book] 離散数学のすすめ2010
- Author(s)
  伊藤大雄, 宇野裕之編著, (玉置卓,第16章)
- Total Pages
  325
- Publisher
  現代数学社
- Data Source
  KAKENHI-PROJECT-20700011
[Journal Article] On Computing a?Center Persistence Diagram2023
- Author(s)
  Higashikawa Yuya、Katoh Naoki、Lin Guohui、Miyano Eiji、Tamaki Suguru、Teruyama Junichi、Zhu Binhai
- Journal Title
  
  Proc of 24th International Symposium on Fundamentals of Computation Theory
  
  Volume: LNCS 14292 Pages: 262-275
- DOI
  10.1007/978-3-031-43587-4_19
- ISBN
  9783031435867, 9783031435874
- Peer Reviewed / Open Access / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-21K11755, KAKENHI-PLANNED-20H05967, KAKENHI-PLANNED-20H05794
[Journal Article] Additive-error fine-grained quantum supremacy2020
- Author(s)
  Morimae Tomoyuki、Tamaki Suguru
- Journal Title
  
  Quantum
  
  Volume: 4 Pages: 329-329
- DOI
  10.22331/q-2020-09-24-329
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-18K11164, KAKENHI-PROJECT-18H04090, KAKENHI-PLANNED-20H05967
[Journal Article] Quantum Query Complexity of Unitary Operator Discrimination2019
- Author(s)
  KAWACHI Akinori、KAWANO Kenichi、LE GALL Francois、TAMAKI Suguru
- Journal Title
  
  IEICE Trans. Inf. & Syst.
  
  Volume: E102.D Issue: 3 Pages: 483-491
- DOI
  10.1587/transinf.2018FCP0012
- NAID
  130007606941
- ISSN
  0916-8532, 1745-1361
- Year and Date
  2019-03-01
- Language
  English
- Peer Reviewed / Open Access / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11164, KAKENHI-PROJECT-17K12640, KAKENHI-PROJECT-16H01705, KAKENHI-PROJECT-18H04090, KAKENHI-PROJECT-16H05853, KAKENHI-PROJECT-17H01695
[Journal Article] Fine-grained quantum computational supremacy2019
- Author(s)
  Tomoyuki Morimae and Suguru Tamaki
- Journal Title
  
  Quantum Information & Computation
  
  Volume: 19(13&14) Pages: 1089-1115
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18K11164
[Journal Article] An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number2019
- Author(s)
  Kobayashi Yasuaki、Kobayashi Yusuke、Miyazaki Shuichi、Tamaki Suguru
- Journal Title
  
  Proceedings of the 30th International Workshop on Combinatorial Algorithms (IWOCA 2019)
  
  Volume: 30 Pages: 327-338
- DOI
  10.1007/978-3-030-25005-8_27
- ISBN
  9783030250041, 9783030250058
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-18H05291, KAKENHI-PROJECT-18H04090, KAKENHI-PROJECT-16K16010
[Journal Article] Fine-grained quantum computational supremacy2019
- Author(s)
  Tomoyuki Morimae and Suguru Tamaki
- Journal Title
  
  Quantum Information & Computation
  
  Volume: 19
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18H04090
[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] Gate elimination: Circuit size lower bounds and #SAT upper bounds2018
- Author(s)
  Golovnev Alexander、Kulikov Alexander S.、Smal Alexander V.、Tamaki Suguru
- Journal Title
  
  Theoretical Computer Science
  
  Volume: 719 Pages: 46-63
- DOI
  10.1016/j.tcs.2017.11.008
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-26330011, KAKENHI-PROJECT-18K11164, KAKENHI-PROJECT-18H04090
[Journal Article] Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues2018
- Author(s)
  Tamaki Suguru、Yoshida Yuichi
- Journal Title
  
  ACM Transactions on Algorithms
  
  Volume: 14 Issue: 4 Pages: 1-13
- DOI
  10.1145/3228342
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18K11164, KAKENHI-PROJECT-18H04090
[Journal Article] Improved exact algorithms for mildly sparse instances of Max SAT2017
- Author(s)
  Sakai Takayuki、Seto Kazuhisa、Tamaki Suguru、Teruyama Junichi
- Journal Title
  
  Theoretical Computer Science
  
  Volume: 697 Pages: 58-68
- DOI
  10.1016/j.tcs.2017.07.011
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-26330011
[Journal Article] Local restrictions from the Furst-Saxe-Sipser paper2017
- Author(s)
  S. Tamaki and O. Watanabe
- Journal Title
  
  Theory of Computing Systems
  
  Volume: 60(1) Issue: 1 Pages: 20-32
- DOI
  10.1007/s00224-016-9730-0
- NAID
  120006582572
- Peer Reviewed / Acknowledgement Compliant / Open Access
- Data Source
  KAKENHI-PLANNED-24106008, KAKENHI-PROJECT-26330011, KAKENHI-WRAPUP-17H06074
[Journal Article] Parallel Repetition of Two-Prover One-Round Games: An Exposition2015
- Author(s)
  Suguru Tamaki
- Journal Title
  
  IIS
  
  Volume: 21 Issue: 4 Pages: 289-306
- DOI
  10.4036/iis.2015.L.01
- NAID
  110009992967
- ISSN
  1340-9050, 1347-6157
- Language
  English
- Peer Reviewed / Acknowledgement Compliant / Open Access
- Data Source
  KAKENHI-PROJECT-26330011, KAKENHI-PLANNED-24106003
[Journal Article] ネヴァンリンナ賞業績紹介コート2015
- Author(s)
  玉置卓
- Journal Title
  
  数学セミナー
  
  Volume: 54(1) Pages: 48-53
- Data Source
  KAKENHI-PROJECT-26330011
[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] A query efficient non-adaptive long code test with perfect completeness2015
- Author(s)
  Suguru Tamaki, Yuichi Yoshida
- Journal Title
  
  Random Struct. Algorithms
  
  Volume: 47(2) Issue: 2 Pages: 386-406
- DOI
  10.1002/rsa.20549
- NAID
  120005676683
- Peer Reviewed / Acknowledgement Compliant / Open Access
- Data Source
  KAKENHI-PROJECT-26330011, KAKENHI-PLANNED-24106003
[Journal Article] A Query Efficient Non-Adaptive Long Code Test with Perfect Completeness2014
- Author(s)
  Suguru Tamaki, Yuichi Yoshida
- Journal Title
  
  Random Structures & Algorithms
  
  Volume: 未定
- NAID
  120005676683
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23700015
[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] Derandomizing the HSSW Algorithm for 3-SAT2013
- Author(s)
  Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
- Journal Title
  
  Algorithmica
  
  Volume: 67(2) Pages: 112-124
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23700015
[Journal Article] メタアルゴリズムと計算限界証明の不思議な関係2013
- Author(s)
  玉置卓
- Journal Title
  
  電子情報通信学会誌
  
  Volume: 96(9)
- Data Source
  KAKENHI-PLANNED-24106003
[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) Pages: 245-274
- NAID
  120005474485
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23700015
[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] An exact algorithm for the Boolean connectivity problem for k-CNF2011
- Author(s)
  Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
- Journal Title
  
  Theor. Comput. Sci
  
  Volume: 412(35) Pages: 4613-4618
- NAID
  120003338848
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23700015
[Journal Article] An exact algorithm for the Boolean connectivity problem for k-CNF2011
- Author(s)
  K.Makino, S.Tamaki, M.Yamamoto
- Journal Title
  
  Theor.Comput.Sci.
  
  Volume: 412(35) Issue: 35 Pages: 4613-4618
- DOI
  10.1016/j.tcs.2011.04.041
- NAID
  120003338848
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22240001, KAKENHI-PROJECT-23700015
[Journal Article] The Complexity of the Hajos Calculus for Planar Graphs2010
- Author(s)
  K.Iwama, K.Seto, S.Tamaki
- Journal Title
  
  Theoretical Computer Science 411(7-9)
  
  Pages: 1182-1191
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20700011
[Journal Article] On the Boolean connectivity problem for Horn relations.2010
- Author(s)
  Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto.
- Journal Title
  
  Discrete Applied Mathematics 158(18)
  
  Pages: 2024-2030
- Data Source
  KAKENHI-PROJECT-20700011
[Journal Article] The complexity of the Hajos calculus for planar graphs.2010
- Author(s)
  Kazuo Iwama, Kazuhisa Seto, Suguru Tamaki.
- Journal Title
  
  Theor.Comput.Sci. 411(7-9)
  
  Pages: 1182-1191
- Data Source
  KAKENHI-PROJECT-20700011
[Journal Article] On the Boolean connectivity problem for Horn relations2010
- Author(s)
  Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
- Journal Title
  
  Discrete Applied Mathematics
  
  Volume: 158(18) Pages: 2024-2030
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22240001
[Journal Article] The Complexity of the Hajos Calculus for Planar Graphs2010
- Author(s)
  K.Iwama, K.Seto, S.Tamaki
- Journal Title
  
  Theoretical Computer Science 411(7-9)
  
  Pages: 1182-1191
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19200001
[Journal Article] On the Boolean connectivity problem for Horn relations2010
- Author(s)
  Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
- Journal Title
  
  Discrete Applied Mathematics
  
  Volume: 158(18) Pages: 2024-2030
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20700011
[Journal Article] The Planar Hajos Calculus for Bounded Degree Graphs2010
- Author(s)
  Kazuo Iwama, Kazuhisa Seto, Suguru Tamaki
- Journal Title
  
  IEICE Transactions
  
  Volume: 93-A(6) Pages: 1000-1007
- NAID
  10026864512
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22240001
[Journal Article] 確率的検査可能証明と近似不可能性2010
- Author(s)
  玉置卓
- Journal Title
  
  電子情報通信学会知識ベース 6群2編7章2節
- Data Source
  KAKENHI-PROJECT-19200001
[Journal Article] The Planar Hajos Calculus for Bounded Degree Graphs2010
- Author(s)
  K.Iwama, K.Seto, S.Tamaki
- Journal Title
  
  IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E93-A(6)
- NAID
  10026864512
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20700011
[Journal Article] 確率的検査可能証明と近似不可能性2010
- Author(s)
  玉置卓
- Journal Title
  
  電子情報通信学会知識ベース 6群2編7章2節
- Data Source
  KAKENHI-PROJECT-20700011
[Journal Article] The Planar Hajos Calculus for Bounded Degree Graphs.2010
- Author(s)
  Kazuo Iwama, Kazuhisa Seto, Suguru Tamaki.
- Journal Title
  
  IEICE Transactions 93-A(6)
  
  Pages: 1000-1007
- NAID
  10026864512
- Data Source
  KAKENHI-PROJECT-20700011
[Journal Article] The Planar Hajos Calculus for Bounded Degree Graphs2010
- Author(s)
  Kazuo Iwama, Kazuhisa Seto, Suguru Tamaki
- Journal Title
  
  IEICE Transactions
  
  Volume: 93-A(6) Pages: 1000-1007
- NAID
  10026864512
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20700011
[Journal Article] The Planar Hajos Calculus for Bounded Degree Graphs2010
- Author(s)
  K.Iwama, K.Seto, S.Tamaki
- Journal Title
  
  IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E93-A(6)
- NAID
  10026864512
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19200001
[Journal Article] New Graph Calculi for Planar Non-3-Colorable Graphs.2008
- Author(s)
  Youichi Hanatani, Takashi Horiyama, Kazuo Iwama, Suguru Tamaki.
- Journal Title
  
  IEICE Transactions 91-A(9)
  
  Pages: 2301-2307
- NAID
  10026851334
- Data Source
  KAKENHI-PROJECT-20700011
[Journal Article] New Graph Calculi for Planar Non-3-Colorable Graphs2008
- Author(s)
  Y. Hanatani, T. Horiyama, K. Iwama and S. Tamaki
- Journal Title
  
  IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E91-A(9)
  
  Pages: 2301-2307
- NAID
  10026851334
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20700011
[Journal Article] New Graph Calculi for Planar Non-3-Colorable Graphs2008
- Author(s)
  Y. Hanatani, T. Horyama, K. Iwama, S. Tamaki
- Journal Title
  
  IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E91-A(9)
  
  Pages: 2301-2307
- NAID
  10026851334
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19200001
[Journal Article] Exploiting partial knowledge of satisfying assignments2007
- Author(s)
  K. Iwama, S. Tamaki
- Journal Title
  
  Discrete Applied Mathematics 155(12)
  
  Pages: 1596-1603
- NAID
  110003191894
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19200001
[Journal Article] A Query Efficient Non-Adaptive Long Code Test with Perfect Completeness
- Author(s)
  Suguru Tamaki, Yuichi Yoshida
- Journal Title
  
  Random Structures & Algorithms
  
  Volume: (to appear)
- NAID
  120005676683
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23700015
[Journal Article] An Exact Algorithm for the Boolean Connectivity Problem for k-CNF.Theor.
- Author(s)
  Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto.
- Journal Title
  
  Comput.Sci. (to appear.)
- Data Source
  KAKENHI-PROJECT-20700011
[Presentation] On Computing a Center Persistence Diagram2023
- Author(s)
  Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu
- Organizer
  24th International Symposium on Fundamentals of Computation Theory
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-22K11909
[Presentation] 情報社会を支えるアルゴリズム2023
- Author(s)
  玉置卓
- Organizer
  ひょうご講座【データサイエンス】ビッグデータ、AIとその周辺を読みとく第7回
- Data Source
  KAKENHI-ORGANIZER-20H05961
[Presentation] 制約充足問題の研究: アルゴリズムと計算複雑性2021
- Author(s)
  玉置卓
- Organizer
  第39回STクラブ
- Data Source
  KAKENHI-PLANNED-20H05967
[Presentation] SATの解空間連結性判定問題の計算複雑性について2021
- Author(s)
  玉置卓
- Organizer
  組合せ遷移第12回セミナー・勉強会
- Invited
- Data Source
  KAKENHI-PROJECT-18K11164
[Presentation] 有限体上の多変数連立代数方程式系に対する総当り探索の打破2021
- Author(s)
  玉置卓
- Organizer
  兵庫県立大学知の交流シンポジウム
- Data Source
  KAKENHI-PLANNED-20H05967
[Presentation] SATの解空間連結性判定問題の計算複雑性について2021
- Author(s)
  玉置卓
- Organizer
  組合せ遷移第12回セミナー・勉強会
- Invited
- Data Source
  KAKENHI-PLANNED-20H05967
[Presentation] 制約充足問題の研究: アルゴリズムと計算複雑性2021
- Author(s)
  玉置卓
- Organizer
  第39回STクラブ
- Invited
- Data Source
  KAKENHI-PROJECT-18K11164
[Presentation] OV仮定, 3-SUM仮定, APSP仮定に基づく精微な量子超越性2020
- Author(s)
  早川龍, 森前智行, 玉置卓
- Organizer
  第1回量子ソフトウェア研究発表会
- Data Source
  KAKENHI-PROJECT-18K11164
[Presentation] 精微な量子超越性の階層性定理2020
- Author(s)
  早川龍, 森前智行, 玉置卓
- Organizer
  日本物理学会 2020年秋季大会
- Data Source
  KAKENHI-PROJECT-18K11164
[Presentation] 精微な量子計算超越性2019
- Author(s)
  森前智行, 玉置卓
- Organizer
  精微な量子計算超越性電子情報通信学会コンピュテーション研究会, September (岡山大学, 岡山市)
- Data Source
  KAKENHI-PROJECT-18K11164
[Presentation] Beating brute force for systems of polynomial equations over finite fields2019
- Author(s)
  Suguru Tamaki
- Organizer
  MPI-INF and MPI-MiS joint workshop on Theoretical Computer Science and Algebraic Geometry
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H04090
[Presentation] Beating Brute Force for Systems of Polynomial Equations over Finite Fields2019
- Author(s)
  Suguru Tamaki
- Organizer
  MPI-INF and MPI-MiS joint workshop on Theoretical Computer Science and Algebraic Geometry
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11164
[Presentation] Stabilizer rank: Sparse representation for classical simulation of quantum circuits2019
- Author(s)
  Suguru Tamaki
- Organizer
  代数幾何学的計算理論とその周辺ミニワークショップ, August (東京大学, 東京都目黒区)
- Data Source
  KAKENHI-PROJECT-18K11164
[Presentation] An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number2019
- Author(s)
  Yasuaki Kobayashi, Yusuke Kobayashi, Shuichi Miyazaki and Suguru Tamaki
- Organizer
  The 30th International Workshop on Combinatorial Algorithms (IWOCA)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11164
[Presentation] 精微な計算複雑性と暗号理論2018
- Author(s)
  玉置卓
- Organizer
  第10回暗号及び情報セキュリティと数学の相関ワークショップ (CRISMATH 2018)
- Invited
- Data Source
  KAKENHI-PROJECT-18K11164
[Presentation] Fine-Grained Complexity and Cryptography: A Personal Survey2018
- Author(s)
  玉置卓
- Organizer
  代数的手法による数理暗号解析に関する研究集会
- Invited
- Data Source
  KAKENHI-PROJECT-26330011
[Presentation] Beating Brute Force for Systems of Polynomial Equations over Finite Fields2017
- Author(s)
  Daniel Lokshtanov, Ramamohan Paturi, Suguru Tamaki, Ryan Williams and Huacheng Yu
- Organizer
  SODA 2017
- Place of Presentation
  Barcelona, Spain
- Year and Date
  2017-01-16
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-26330011
[Presentation] Beating Brute Force for Systems of Polynomial Equations over Finite Fields2017
- Author(s)
  Suguru Tamaki
- Organizer
  ERATO感謝祭 Season IV
- Invited
- Data Source
  KAKENHI-PROJECT-26330011
[Presentation] 有限体上の多変数連立代数方程式系に対する総当り探索の打破2017
- Author(s)
  玉置卓
- Organizer
  電子情報通信学会コンピュテーション研究会
- Place of Presentation
  南山大学, 名古屋市
- Year and Date
  2017-03-07
- Invited
- Data Source
  KAKENHI-PROJECT-26330011
[Presentation] Quantum Query Complexity of Unitary Operator Discrimination2017
- Author(s)
  Akinori Kawachi, Kenichi Kawano, Francois Le Gall, Suguru Tamaki
- Organizer
  COCOON 2017
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-26330011
[Presentation] Recent Developments on Circuit Satisfiability Algorithms2016
- Author(s)
  Suguru Tamaki
- Organizer
  Computational Complexity Conference (CCC) Satellite Tokyo Workshop
- Place of Presentation
  Tokyo
- Invited / Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-24106003
[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
  MFCS 2016
- Place of Presentation
  Krakow, Poland
- Year and Date
  2016-08-22
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-26330011
[Presentation] Recent Developments on Circuit Satisfiability Algorithms2016
- Author(s)
  Suguru Tamaki
- Organizer
  Computational Complexity Conference (CCC) Satellite Tokyo Workshop
- Place of Presentation
  学士会館, 東京都千代田区
- Year and Date
  2016-05-28
- Invited
- Data Source
  KAKENHI-PROJECT-26330011
[Presentation] Recent Developments on Circuit Satisfiability Algorithms2016
- Author(s)
  Suguru Tamaki
- Organizer
  Fine-Grained Complexity and Algorithm Design Reunion
- Place of Presentation
  UC Berkeley, USA
- Year and Date
  2016-12-12
- Invited
- Data Source
  KAKENHI-PROJECT-26330011
[Presentation] Circuit size lower bounds and #SAT upper bounds through a general framework2016
- Author(s)
  Alexander Golovnev, Alexander S. Kulikov, Alexander V. Smal and Suguru Tamaki
- Organizer
  MFCS 2016
- Place of Presentation
  Krakow, Poland
- Year and Date
  2016-08-22
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-26330011
[Presentation] Satisfiability Algorithms for Small Depth Circuits with Symmetric Gates2015
- Author(s)
  Suguru Tamaki
- Organizer
  Workshop on Connections Between Algorithm Design and Complexity Theory
- Place of Presentation
  Simons Institute, UC Berkeley, USA
- Year and Date
  2015-11-02
- Invited / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-26330011
[Presentation] Faster satisfiability algorithms for systems of polynomial equations over finite fields and AC0[p]2015
- Author(s)
  Suguru Tamaki
- Organizer
  Workshop on Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time Algorithms
- Place of Presentation
  Berkeley (USA)
- Year and Date
  2015-11-03
- Invited / Int'l Joint Research
- 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-26330011
[Presentation] Faster Satisfiability Algorithms for Systems of Polynomial Equations over Finite Fields and ACC0[p]2015
- Author(s)
  Suguru Tamaki
- Organizer
  Workshop on Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time
- Place of Presentation
  Simons Institute, UC Berkeley, USA
- Year and Date
  2015-09-28
- Invited / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-26330011
[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] Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction2014
- Author(s)
  Takayuki Sakai, Kazuhisa Seto and Suguru Tamaki
- Organizer
  Proceedings of the 17th International Conference on Theory and Applications of Satisfiability Testing (SAT)
- Place of Presentation
  (to appear)
- Data Source
  KAKENHI-PROJECT-23700015
[Presentation] The complexity of robust satisfiability of the constraint satisfaction problem2014
- Author(s)
  Suguru Tamaki
- Organizer
  Dagstuhl Seminar 14201
- Place of Presentation
  Saarland, Germany
- Invited
- Data Source
  KAKENHI-PROJECT-23700015
[Presentation] Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction2014
- Author(s)
  Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki
- Organizer
  The 17th International Conference on Theory and Applications of Satisfiability Testing
- Place of Presentation
  Vienna, Austria
- Data Source
  KAKENHI-PROJECT-23700015
[Presentation] Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction2014
- Author(s)
  Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki
- Organizer
  The 7th AAAC Annual Meeting
- Place of Presentation
  Hangzhou, China
- Data Source
  KAKENHI-PROJECT-23700015
[Presentation] The complexity of robust satisfiability of the constraint satisfaction problem2013
- Author(s)
  Suguru Tamaki
- Organizer
  The 6th AAAC Annual Meeting
- Place of Presentation
  Matsushima, Japan
- Data Source
  KAKENHI-PROJECT-23700015
[Presentation] A satisfiability algorithm and average-case hardness for formulas over the full binary basis2013
- Author(s)
  Suguru Tamaki
- Organizer
  Dagstuhl Seminar 13331
- Place of Presentation
  Saarland, Germany
- Invited
- Data Source
  KAKENHI-PROJECT-23700015
[Presentation] A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis2012
- Author(s)
  K.Seto, S.Tamaki
- Organizer
  CCC 2012
- Place of Presentation
  Porto, Portugal(発表確定)
- Data Source
  KAKENHI-PROJECT-22240001
[Presentation] A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis2012
- Author(s)
  K. Seto, S. Tamaki
- Organizer
  CCC 2012 (発表確定)
- Place of Presentation
  Porto, Portugal
- Data Source
  KAKENHI-PROJECT-23700015
[Presentation] Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues2012
- Author(s)
  Suguru Tamaki and Yuichi Yoshida
- Organizer
  APPROX 2012
- Place of Presentation
  Cambridge, MA, USA
- Data Source
  KAKENHI-PLANNED-24106003
[Presentation] A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis2012
- Author(s)
  Kazuhisa Seto, Suguru Tamaki
- Organizer
  Proceedings of the 27th IEEE Conference on Computational Complexity (CCC)
- Place of Presentation
  (pages 107-116)
- Data Source
  KAKENHI-PROJECT-23700015
[Presentation] Linear programming programming, width-1 CSPs, and robust satisfaction.2012
- Author(s)
  Gabor Kun, Ryan O'Donnell, Suguru Tamaki, Yuichi Yoshida, Yuan Zhou
- Organizer
  ITCS
- Place of Presentation
  Cambridge, USA
- Year and Date
  2012-01-09
- Data Source
  KAKENHI-PROJECT-22240001
[Presentation] Linear programming, width-1 CSPs, and robust satisfaction2012
- Author(s)
  G.Kun, R.O'Donnell, S.Tamaki, Y.Yoshida, Y.Zhou
- Organizer
  ITCS 2012
- Place of Presentation
  Cambridge, MA, USA
- Year and Date
  2012-01-10
- Data Source
  KAKENHI-PROJECT-22240001
[Presentation] A Satisfiability Algorithm for Formulas over the Full Binary Basis2012
- Author(s)
  K. Seto, S. Tamaki
- Organizer
  RIMS研究集会「アルゴリズムと計算理論の新展開」(冬のLAシンポジウム)
- Place of Presentation
  Kyoto, Japan
- Data Source
  KAKENHI-PROJECT-23700015
[Presentation] Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues2012
- Author(s)
  Suguru Tamaki, Yuichi Yoshida
- Organizer
  Proceedings of the 15th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)
- Place of Presentation
  (pages 313-324)
- Data Source
  KAKENHI-PROJECT-23700015
[Presentation] Linear programming, width-1 CSPs, and robust satisfaction2012
- Author(s)
  G. Kun, R. O'Donnell, S. Tamaki, Y. Yoshida, Y. Zhou
- Organizer
  ITCS 2012
- Place of Presentation
  Cambridge, MA, USA
- Data Source
  KAKENHI-PROJECT-23700015
[Presentation] Linear programming, width-1 CSPs, and robust satisfaction2012
- Author(s)
  Gabor Kun, Ryan O'Donnell, Suguru Tamaki, Yuichi Yoshida, Yuan Zhou
- Organizer
  Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (ITCS)
- Place of Presentation
  (pages 484-495)
- Data Source
  KAKENHI-PROJECT-23700015
[Presentation] 指数時間厳密アルゴリズム2011
- Author(s)
  玉置卓
- Organizer
  学術情報メディアセンターセミナー「アルゴリズムと計算量理論」(招待講演)
- Place of Presentation
  Kyoto, Japan
- Data Source
  KAKENHI-PROJECT-23700015
[Presentation] Derandomizing HSSW Algorithm for 3-SAT2011
- Author(s)
  K. Makino, S. Tamaki, M. Yamamoto
- Organizer
  ISAAC 2011
- Place of Presentation
  Yokohama, Japan
- Data Source
  KAKENHI-PROJECT-23700015
[Presentation] Derandomizing HSSW Algorithm for 3-SAT2011
- Author(s)
  K.Makino, S.Tamaki, M.Yamamoto
- Organizer
  COCOON 2011
- Place of Presentation
  Dallas, Texas, USA
- Year and Date
  2011-08-14
- Data Source
  KAKENHI-PROJECT-22240001
[Presentation] Derandomizing HSSW Algorithm for 3-SAT2011
- Author(s)
  Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
- Organizer
  Proceedings of the 17th Annual International Computing and Combinatorics Conference (COCOON)
- Place of Presentation
  (pages 1-12)
- Data Source
  KAKENHI-PROJECT-23700015
[Presentation] Linear programming, width-1 CSPs, and robust satisfaction2011
- Author(s)
  G. Kun, R. O'Donnell, S. Tamaki, Y. Yoshida, Y. Zhou
- Organizer
  2011年夏のLAシンポジウム
- Place of Presentation
  Shizuoka, Japan
- Data Source
  KAKENHI-PROJECT-23700015
[Presentation] An Exact Algorithm for the Boolean Connectivity Problem for k-CNF2010
- Author(s)
  K.Makino, S.Tamaki, M.Yamamoto
- Organizer
  13th International Conference on Theory and Applications of Satisfiability Testing
- Place of Presentation
  Edinburgh, Scotland
- Year and Date
  2010-07-11
- Data Source
  KAKENHI-PROJECT-20700011
[Presentation] An Exact Algorithm for the Boolean Connectivity Problem for k-CNF.2010
- Author(s)
  Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto.
- Organizer
  The 13th International Conference on Theory and Applications of Satisfiability Testing (SAT)
- Place of Presentation
  Edinburgh, Scotland, UK.
- Year and Date
  2010-07-11
- Data Source
  KAKENHI-PROJECT-20700011
[Presentation] 3SATに対する乱択アルゴリズムの改良2010
- Author(s)
  玉置卓
- Organizer
  ERATO湊離散構造処理系+NEO合同研究会
- Place of Presentation
  北海道大学,札幌市(招待講演)
- Data Source
  KAKENHI-PROJECT-20700011
[Presentation] Improved Randomized Algorithms for 3-SAT.2010
- Author(s)
  Kazuo Iwama, Kazuhisa Seto, Tadashi Takai, Suguru Tamaki.
- Organizer
  The 21st International Symposium on Algorithms and Computation (ISAAC)
- Place of Presentation
  Jeju Island, Korea.
- Year and Date
  2010-12-15
- Data Source
  KAKENHI-PROJECT-20700011
[Presentation] Enumerating Non-3-colorable Planar Graphs by the Hajos Calculus2010
- Author(s)
  K.Iwama, K.Seto, S.Tamaki
- Organizer
  電子情報通信学会総合大会 DS-1-4
- Place of Presentation
  東北大学,仙台市
- Year and Date
  2010-03-18
- Data Source
  KAKENHI-PROJECT-20700011
[Presentation] Enumerating Non-3-colorable Planar Graphs by the Hajos Calculus2010
- Author(s)
  K.Iwama, K.Seto, S.Tamaki
- Organizer
  The 3rd AAAC Annual Meeting
- Place of Presentation
  Pohang, Korea
- Year and Date
  2010-04-17
- Data Source
  KAKENHI-PROJECT-20700011
[Presentation] An Exact Algorithm for the Boolean Connectivity Problem for k-CNF2010
- Author(s)
  Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
- Organizer
  SAT 2010
- Place of Presentation
  Edinburgh, Scotland, UK
- Year and Date
  2010-07-11
- Data Source
  KAKENHI-PROJECT-20700011
[Presentation] 3-SAT∈RTIME(0(1.3211^n))2010
- Author(s)
  K.Iwama, T.Takai, S.Tamaki
- Organizer
  RIMS研究集会「アルゴリズムと計算機科学の数理的基盤とその応用」
- Place of Presentation
  京都大学,京都市
- Year and Date
  2010-02-03
- Data Source
  KAKENHI-PROJECT-20700011
[Presentation] A Query Efficient Non-adaptive Long Code Test with Perfect Completeness2010
- Author(s)
  Suguru Tamaki, Yuichi Yoshida
- Organizer
  APPROX-RANDOM 2010
- Place of Presentation
  UPC Barcelona, Spain
- Year and Date
  2010-09-09
- Data Source
  KAKENHI-PROJECT-20700011
[Presentation] A Query Efficient Non-adaptive Long Code Test with Perfect Completeness.2010
- Author(s)
  Suguru Tamaki, Yuichi Yoshida.
- Organizer
  The 14th International Workshop on Randomized Techniques in Computation (APPROX-RANDOM)
- Place of Presentation
  UPC Barcelona, Spain.
- Year and Date
  2010-09-09
- Data Source
  KAKENHI-PROJECT-20700011
[Presentation] An Exact Algorithm for the Boolean Connectivity Problem for k-CNF2010
- Author(s)
  Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
- Organizer
  SAT 2010
- Place of Presentation
  Edinburgh, Scotland, UK
- Year and Date
  2010-07-11
- Data Source
  KAKENHI-PROJECT-22240001
[Presentation] Improved Randomized Algorithms for 3-SAT2010
- Author(s)
  K.Iwama, T.Takai, S.Tamaki
- Organizer
  The 3rd AAAC Annual Meeting
- Place of Presentation
  Pohang, Korea
- Year and Date
  2010-04-19
- Data Source
  KAKENHI-PROJECT-20700011
[Presentation] Improved Randomized Algorithms for 3-SAT2010
- Author(s)
  Kazuo Iwama, Kazuhisa Seto, Tadashi Takai, Suguru Tamaki
- Organizer
  ISAAC 2010
- Place of Presentation
  Jeju Island, Korea
- Year and Date
  2010-12-15
- Data Source
  KAKENHI-PROJECT-20700011
[Presentation] Derandomizing HSSW Algorithm for 3-SAT.2010
- Author(s)
  Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto.
- Organizer
  The 17th Annual International Computing and Combinatorics Conference (COCOON)
- Place of Presentation
  Dallas, Texas, USA.
- Data Source
  KAKENHI-PROJECT-20700011
[Presentation] Improved Randomized Algorithms for 3-SAT2010
- Author(s)
  Kazuo Iwama, Kazuhisa Seto, Tadashi Takai, Suguru Tamaki
- Organizer
  ISAAC 2010
- Place of Presentation
  Jeju Island, Korea
- Year and Date
  2010-12-15
- Data Source
  KAKENHI-PROJECT-22240001
[Presentation] A Query Efficient Non-adaptive Long Code Test with Perfect Completeness2010
- Author(s)
  Suguru Tamaki, Yuichi Yoshida
- Organizer
  APPROX-RANDOM 2010
- Place of Presentation
  UPC Barcelona, Spain
- Year and Date
  2010-09-09
- Data Source
  KAKENHI-PROJECT-22240001
[Presentation] An Exact Algorithm for the Boolean Connectivity Problem for k-CNF.2010
- Author(s)
  K. Makino, S. Tamaki, M. Yamamoto
- Organizer
  13th International Conference on Theory and Applications of Satisfiability Testing
- Place of Presentation
  Edinburgh, Scotland
- Year and Date
  2010-07-11
- Data Source
  KAKENHI-PROJECT-19200001
[Presentation] Hajos Calculusの計算複雑さ2009
- Author(s)
  玉置卓
- Organizer
  ワークショップ「離散アルゴリズムの最先端」
- Place of Presentation
  東京工業大学
- Year and Date
  2009-02-23
- Data Source
  KAKENHI-PROJECT-20700011
[Presentation] Enumerating Non-3-colorable Planar Graphs by the Hajos Calculus2009
- Author(s)
  K.Iwama, K.Seto, S.Tamaki
- Organizer
  12th Korea-Japan Joint Workshop on Algorithms and Computation
- Place of Presentation
  Seoul, Korea
- Year and Date
  2009-07-04
- Data Source
  KAKENHI-PROJECT-20700011
[Presentation] The Planar Hajos Calculus for Bounded Degree Graphs2009
- Author(s)
  K.Iwama, K.Seto, S.Tamaki
- Organizer
  The 2nd AAAC Annual Meeting
- Place of Presentation
  Hangzhou, China
- Year and Date
  2009-04-11
- Data Source
  KAKENHI-PROJECT-20700011
[Presentation] Enumerating Non-3-colorable Planar Graphs by the Hajo's Calculus2009
- Author(s)
  K.Iwama, K.Seto, S.Tamaki
- Organizer
  12th Korea-Japan Joint Workshop on Algorithms and Computation(WAAC 2009)
- Place of Presentation
  Seoul, Korea
- Year and Date
  2009-07-04
- Data Source
  KAKENHI-PROJECT-19200001
[Presentation] Enumerating Non-3-colorable Planar Graphs by the Hajos Calculus.2009
- Author(s)
  Kazuo Iwama, Kazuhisa Seto, Suguru Tamaki.
- Organizer
  12th Korea-Japan Joint Workshop on Algorithms and Computation (WAAC)
- Place of Presentation
  Seoul, Korea.
- Year and Date
  2009-07-04
- Data Source
  KAKENHI-PROJECT-20700011
[Presentation] The Planar Hajos Calculus for Bounded Degree Graphs2009
- Author(s)
  K.Iwama, K.Seto, S.Tamaki
- Organizer
  2nd Asian Association for Algorithms and Computation(AAAC 2009)
- Place of Presentation
  Hangzhou, China
- Year and Date
  2009-04-11
- Data Source
  KAKENHI-PROJECT-19200001
[Presentation] An Improvement of the Soundness of a 3-Bit PCP2009
- Author(s)
  N. Kinoshita, S. Tamaki and K. Iwama
- Organizer
  RIMS研究集会「理論計算機科学の深化と応用」
- Place of Presentation
  京都大学
- Year and Date
  2009-02-03
- Data Source
  KAKENHI-PROJECT-20700011
[Presentation] The Planar Hajos Calculus for Bounded Degree Graphs2009
- Author(s)
  K. Iwama, K. Seto and S. Tamaki
- Organizer
  The Second AAAC Annual Meeting
- Place of Presentation
  Hangzhou, China
- Year and Date
  2009-04-11
- Data Source
  KAKENHI-PROJECT-20700011
[Presentation] The Complexity of the Hajos Calculus for Planar Graphs2008
- Author(s)
  K. Iwama, S. Tamaki
- Organizer
  1st Asian Association for Algorithms and Computation
- Place of Presentation
  Hong Kong
- Year and Date
  2008-04-27
- Data Source
  KAKENHI-PROJECT-19200001
[Presentation] The Complexity of the Hajos Calculus for Planar Graphs2008
- Author(s)
  K. Iwama and S. Tamaki
- Organizer
  The First AAAC Annual Meeting
- Place of Presentation
  Hong Kong
- Year and Date
  2008-04-28
- Data Source
  KAKENHI-PROJECT-20700011
[Presentation] A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis
- Author(s)
  Kazuhisa Seto, Suguru Tamaki
- Organizer
  IEEE Conference on Computational Complexity 2012
- Place of Presentation
  Porto, Portugal
- Data Source
  KAKENHI-PROJECT-23700015
[Presentation] Robust Approximation of Temporal CSP
- Author(s)
  S. Tamaki and Y. Yoshida
- Organizer
  The 17th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems
- Place of Presentation
  Barcelona, Spain
- Year and Date
  2014-09-04 – 2014-09-06
- Data Source
  KAKENHI-PROJECT-26330011
[Presentation] Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues
- Author(s)
  Suguru Tamaki, Yuichi Yoshida
- Organizer
  APPROX-RANDOM 2012
- Place of Presentation
  Boston, USA
- Data Source
  KAKENHI-PROJECT-23700015
[Presentation] 最大充足可能性問題の疎な例題に対する厳密アルゴリズムの改良
- Author(s)
  酒井隆行, 玉置卓
- Organizer
  情報処理学会第77回全国大会
- Place of Presentation
  京都大学, 京都市
- Year and Date
  2015-03-17 – 2015-03-19
- Data Source
  KAKENHI-PROJECT-26330011
[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] The complexity of robust satisfiability of the constraint satisfaction problem
- Author(s)
  S. Tamaki
- Organizer
  Dagstuhl Seminar 14201
- Place of Presentation
  Schloss Dagstuhl, Germany
- Year and Date
  2014-05-11 – 2014-05-16
- Invited
- Data Source
  KAKENHI-PROJECT-26330011
[Presentation] Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues
- Author(s)
  Suguru Tamaki, Yuichi Yoshida
- Organizer
  APPROX-RANDOM 2012
- Place of Presentation
  Boston, USA
- Data Source
  KAKENHI-PROJECT-22240001
[Presentation] A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis
- Author(s)
  Kazuhisa Seto, Suguru Tamaki
- Organizer
  IEEE Conference on Computational Complexity 2012
- Place of Presentation
  Porto, Portugal
- Data Source
  KAKENHI-PROJECT-22240001
[Presentation] The complexity of robust satisfiability of the constraint satisfaction problem
- Author(s)
  Suguru Tamaki
- Organizer
  AAAC 2013
- Place of Presentation
  Matsushima, Japan
- Data Source
  KAKENHI-PROJECT-23700015
[Presentation] Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction
- Author(s)
  T. Sakai, K. Seto and S. 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-26330011
[Presentation] Robust Approximation of Temporal CSP
- Author(s)
  Suguru Tamaki, Yuichi Yoshida
- Organizer
  APPROX-RANDOM 2014
- Place of Presentation
  Barcelona, Spain
- Year and Date
  2014-09-04 – 2014-09-06
- Data Source
  KAKENHI-PROJECT-25240002
[Presentation] Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction
- Author(s)
  T. Sakai, K. Seto and S. Tamaki
- Organizer
  The 7th AAAC Annual Meeting
- Place of Presentation
  Hangzhou, China
- Year and Date
  2014-05-17 – 2014-05-19
- Data Source
  KAKENHI-PROJECT-26330011

1. ITO Hiro (50283487)

# of Collaborated Projects: 5 results

# of Collaborated Products: 0 results
2. IWAMA Kazuo (50131272)

# of Collaborated Projects: 4 results

# of Collaborated Products: 9 results
3. MIYAZAKI Shuichi (00303884)

# of Collaborated Projects: 4 results

# of Collaborated Products: 0 results
4. WATANABE Osamu (80158617)

# of Collaborated Projects: 4 results

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

# of Collaborated Projects: 4 results

# of Collaborated Products: 0 results
6. TOKUYAMA Takeshi (40312631)

# of Collaborated Projects: 3 results

# of Collaborated Products: 0 results
7. YAMASHITA Masafumi (00135419)

# of Collaborated Projects: 3 results

# of Collaborated Products: 0 results
8. KATOH Naoki (40145826)

# of Collaborated Projects: 2 results

# of Collaborated Products: 0 results
9. SUGIHARA Kokichi (40144117)

# of Collaborated Projects: 2 results

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

# of Collaborated Projects: 2 results

# of Collaborated Products: 0 results
11. KAWAHARA Jun (20572473)

# of Collaborated Projects: 2 results

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

# of Collaborated Projects: 2 results

# of Collaborated Products: 0 results
13. SETO Kazuhisa (20584056)

# of Collaborated Projects: 2 results

# of Collaborated Products: 2 results
14. YOSHIDA Yuichi (50636967)

# of Collaborated Projects: 2 results

# of Collaborated Products: 2 results
15. 牧野和久 (60294162)

# of Collaborated Projects: 2 results

# of Collaborated Products: 0 results
16. 瀧本英二 (50236395)

# of Collaborated Projects: 2 results

# of Collaborated Products: 0 results
17. MORIZUMI Hiroki (50463782)

# of Collaborated Projects: 1 results

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

# of Collaborated Projects: 1 results

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

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
20. 伊東利哉 (20184674)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
21. 天野一幸 (30282031)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
22. 森立平 (60732857)

# of Collaborated Projects: 1 results

# of Collaborated Products: 1 results
23. 平原秀一 (80848440)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
24. 清水伸高 (10910127)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
25. 湊真一 (10374612)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
26. 宇野毅明 (00302977)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
27. 安田宜仁 (50396149)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
28. 山下茂 (30362833)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
29. 上原隆平 (00256471)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
30. 小野廣隆 (00346826)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
31. 定兼邦彦 (20323090)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
32. 渋谷哲朗 (60396893)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
33. 河村彰星 (20600117)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
34. KOBAYASHI Yusuke

# of Collaborated Projects: 0 results

# of Collaborated Products: 1 results
35. 宮野英次

# of Collaborated Projects: 0 results

# of Collaborated Products: 1 results

Tamaki Suguru 玉置 卓

TAMAKI Suguru 玉置 卓

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

Algorithms for Constraint Satisfaction Problems: Deepening and New DirectionsPrincipal 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

Research Field

Research Institution

Studies on efficient exact and approximation algorithms for constraint satisfaction problemsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

Studies on Exact Exponential Time Algorithms for Computationally Intractable ProblemsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Design and Analysis of Algorithms for Computationally Intractable Combinatorial ProblemsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

[Book] 理論計算機科学事典2022

Author(s)

Total Pages

Publisher

ISBN

Tamaki Suguru 玉置卓

TAMAKI Suguru 玉置卓