TANI Seiichi 谷聖一

… Alternative Names

谷聖一タニセイイチ

Less

Researcher Number	70266708
Other IDs	https://orcid.org/0000-0001-7773-3585
External Links
Affiliation (Current)	2025: 日本大学, 文理学部, 教授
Affiliation (based on the past Project Information) *help	2023 – 2024: 日本大学, 文理学部, 教授 2005 – 2011: 日本大学, 文理学部, 教授 1999 – 2004: 日本大学, 文理学部, 助教授 1998: Nihon Univ., College of Humanities and Sci., Assoc Prof., 文理学部, 講師 1997: Tokai University, Faculty of Science, Lectrer, 理学部, 講師 1996: 東海大学, 数学科, 講師
Review Section/Research Field	Principal Investigator Fundamental theory of informatics / 計算機科学 Except Principal Investigator General mathematics (including Probability theory/Statistical mathematics) / Medium-sized Section 9:Education and related fields / General mathematics (including Probability theory/Statistical mathematics) / 計算機科学 / Fundamental theory of informatics / Geometry
Keywords	Principal Investigator Jones polynomial / 離散アルゴリズム / ジョーンズ多項式 / knot theory / computational complexity / discrete al aorithm / Computational topoloay / 量子計算 / トポロジー / アルゴリズム … More / 多項式不変量 / 結び目理論 / 計算量理論 / 計算論的位相幾何学 / conjugacy problem / braid group / links / knots / interactive proof system / discrete algorithms / computational topology / 自明性判定問題 / NP-完全 / 多項式時間階層 / 3-closed braid 絡み / ジョーンズ多項式の計算 / PSPACE / 閉3ブレイド絡み目 / 2橋絡み目 / 共役問題 / ブレイド群 / 絡み目 / 結び目 / 対話型証明系 / 計算論的トポロジー … More Except Principal Investigator 計算量 / アルゴリズム / Jones多項式 / グラフ理論 / 計算量理論 / Montesinos link / 3-braid link / 2-bridge link / chordal graph / Jones polynomial / graph theory / グラフ同型性判定問題 / マッチング / tree width / Complexity / 近似アルゴリズム / 絡み目 / 結び目 / 計算位相幾何学 / 計算位相幾何 / 学力評価手法 / 大学入試 / 教科情報 / computational topology / link theory / 組合せアルゴリズム / Montesinos 絡み目 / 結び目理論 / grid graph / #P complete / polynomial time algorithm / self avoiding walk / graph isomorphism / Computational Complexity / 多項式 / 数え上げ / 超立方体 / 多次元格子 / 多項式時間 / 同型写真像 / 共役問題 / ブレイド / 自明性判定問題 / 数え上げ問題 / self-avoiding walk / 超立方体グラフ / 2次元格子グラフ / 格子グラフ / #P完全性 / 多項式時間アルゴリズム / 単純道数え上げ問題 / graph grammar / isomorphism counting / isomorphism problem / computational complexity / algorithm engineering / グラフ認識問題 / 到達可能性判定問題 / 連結性判定問題 / 木幅 / 独立点集合 / サイクル被覆 / 完全独立全域木 / 辺連結度 / 二分決定グラフ / 全域木 / 同型性判定 / 独立点集合問題 / グラフ文法 / 同型写像数え上げ問題 / 同型性判定問題 / アルゴリズム工学 / hamiltonian / isomorphism / accessibility / reachability / separation width / Graph Theory / Algorithm / 有向グラフ / 無向グラフ / 領域計算量 / パス幅 / 計算理理論 / ハミルトン性 / 同型性 / 到達可能性 / 分割幅 / Merging Network / Graph Isomorphism / Graph Algoritms / Language Processing / Formal Language / Approximation Algoritms / Complete Problems / 機械翻訳 / 構文解析 / マージング・ネットワーク / グラフ同型問題 / グラフアルゴリズム / 自然言語処理 / 形式言語理論 / 完全問題 / 位相不変量 / Montesinos絡み目 / 絡み目不変量 Less

大学入試を中心とした情報分野の学力評価手法の検討
- Principal Investigator
  
  植原啓介
- Project Period (FY)
  2023 – 2027
- Research Category
  
  Grant-in-Aid for Scientific Research (A)
- Review Section
  
  Medium-sized Section 9:Education and related fields
- Research Institution
  Keio University
Computational topology on knots and spatial graphs
- Principal Investigator
  
  YAMAMOTO Makoto
- Project Period (FY)
  2009 – 2011
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  Chuo University
Link Invariant From The Computational Topological Viewpoint
- Principal Investigator
  
  HARA Masao
- Project Period (FY)
  2008 – 2010
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Geometry
- Research Institution
  Tokai University
On Computational Complexity of Computing Jones PolynomialsPrincipal Investigator
- Principal Investigator
  
  TANI Seiichi
- Project Period (FY)
  2005 – 2007
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  Nihon University
Link Theory from the Computational Topological Viewpoint
- Principal Investigator
  
  HARA Masao
- Project Period (FY)
  2005 – 2007
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  General mathematics (including Probability theory/Statistical mathematics)
- Research Institution
  Tokai University
On computational complexity of computing polynomial invariants of linksPrincipal Investigator
- Principal Investigator
  
  TANI Seiichi
- Project Period (FY)
  2002 – 2004
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  計算機科学
- Research Institution
  Nihon University
The Analysis of Computational Complexity of Discrete Problems
- Principal Investigator
  
  TODA Seinosuke
- Project Period (FY)
  2001 – 2003
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  General mathematics (including Probability theory/Statistical mathematics)
- Research Institution
  Nihon University
Analyzing Computational Complexity of Graph-Theoretic Problems with Restrictions on Width Parameters
- Principal Investigator
  
  TODA Seinosuke
- Project Period (FY)
  1998 – 2000
- Research Category
  
  Grant-in-Aid for Scientific Research on Priority Areas (B)
- Research Institution
  Nihon University
Space complexity of undirected graph accessibility problem
- Principal Investigator
  
  TODA Seinosuke
- Project Period (FY)
  1997 – 1998
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  General mathematics (including Probability theory/Statistical mathematics)
- Research Institution
  Nihon University, College of Humanities and Sciences
A Study of the complete Problems for Low-Level Complexity Classes
- Principal Investigator
  
  KASAI Takumi
- Project Period (FY)
  1995 – 1997
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  計算機科学
- Research Institution
  The University of Electro-Communications

All 2023 2010 2009 2008 2007 2006 2005 2004 2003 2002

All Journal Article Presentation Book

[Book] アルゴリズムと計算量2005
- Author(s)
  谷聖一
- Total Pages
  151
- Publisher
  サイエンス社
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-17500014
[Journal Article] O(n^2) time algorithms for computing Jones polynomials of certain links2010
- Author(s)
  Masahiko Murakami, Masao Hara, Seiichi Tani, Makoto Yamamoto
- Journal Title
  
  研究集会「結び目の数学II」報告集
- Data Source
  KAKENHI-PROJECT-21500022
[Journal Article] Fast Algorithms for Computing Jones Polynomials of Montesinos Links2009
- Author(s)
  Masao Hara, Masahiko Murakami, Seiichi Tani, Makoto Yamamoto
- Journal Title
  
  Scientiae Mathematicae Japonicae Vol.69, No.1
  
  Pages: 1-26
- NAID
  10025094629
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20540092
[Journal Article] Fast Algorithms for Computing Jones Polynomials of Certain Links2007
- Author(s)
  M. Murakami, M. Hara, M. Yamamoto, S. Tani
- Journal Title
  
  Theoretical Computer Science 374
  
  Pages: 1-24
- Description
  「研究成果報告書概要(和文)」より
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-17500014
[Journal Article] A Fast Algorithm for Computing Jones Polynomials of Montesinos Links2007
- Author(s)
  村上雅彦, 原正雄, 山本慎, 谷聖一
- Journal Title
  
  京都大学数理解析研究所講究録 1554
  
  Pages: 153-160
- NAID
  10025094629
- Data Source
  KAKENHI-PROJECT-17500014
[Journal Article] Temporal Reasoning System for the Digital Theater Library2007
- Author(s)
  S. Yoshioka, S. Tani, S. Toda, M. Morii, K. Kohno
- Journal Title
  
  Proc.of the IASTED Conference on Internet and Multimedia Systems and Apphcations 2007 (CD-ROM)
- Description
  「研究成果報告書概要(和文)」より
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-17500014
[Journal Article] Fast Algorithms for Computing Jones Polynomials of Certain Links2007
- Author(s)
  M., Murakami, M., Hara, M., Yamamoto, S., Tani
- Journal Title
  
  Theoretical Computer Science 374
  
  Pages: 1-24
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-17500014
[Journal Article] A Fast Algorithm for Computing Jones Polynomials of Montesinos Links2007
- Author(s)
  Masao, Hara, Masahiko, Murakami, Seiichi, Tani, Makoto, Yamamoto
- Journal Title
  
  2007 KOREA-JAPAN Joint Workshop on Algorithms and Computation
  
  Pages: 40-47
- NAID
  10025094629
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-17540135
[Journal Article] A Fast Algorithm for Computing Jones Polynomials of Montesinos Links2007
- Author(s)
  村上雅彦, 原正雄, 山本慎, 谷聖一
- Journal Title
  
  京都大学数理解析研究所講究録 1554
  
  Pages: 153-160
- NAID
  10025094629
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-17500014
[Journal Article] Fast algorithms for computing Jones polynomials of certain links2007
- Author(s)
  Masahiko, Murakami, Masao, Hara, Makoto, Yamamoto, Seiichi, Tani
- Journal Title
  
  Theoretical Computer Science 374
  
  Pages: 1-24
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-17540135
[Journal Article] Kolmogorov記述量に基づく類似度距離による方言自動分類の試行2007
- Author(s)
  田中ゆかり, 谷聖一
- Journal Title
  
  人文科学とコンピュータシンポジウム論文集(情報処理学会シンポジウムシリーズ) Vol.2007No.15
  
  Pages: 171-176
- NAID
  170000083088
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-17500014
[Journal Article] Temporal Reasoning System for the Digital Theater Library2007
- Author(s)
  S., Yoshioka, S., Tani, S., Toda, M., Morii, K., Kohno
- Journal Title
  
  Proc. of the IASTED Conference on Internet and Multimedia Systems and Applications
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-17500014
[Journal Article] Kolmogorov記述量に基づく類似度距離による方言自動分類の試行2007
- Author(s)
  田中ゆかり, 谷聖一
- Journal Title
  
  人文科学とコンピュータシンポジウム論文集(情報処理学会シンポジウムシリーズVol.2007, No.15)
  
  Pages: 171-176
- NAID
  170000083088
- Description
  「研究成果報告書概要(和文)」より
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-17500014
[Journal Article] Extraction of temporal relation by the creation of historical natural disaster archive2006
- Author(s)
  S. Yoshioka, S. Tani, S. Toda
- Journal Title
  
  Proc.of World Academy of Science
  
  Pages: 332-337
- NAID
  170000083049
- Description
  「研究成果報告書概要(和文)」より
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-17500014
[Journal Article] Extraction of temporal relation by the creation of historical natural disaster archive.2006
- Author(s)
  S., Yoshioka, S., Tani, S., Toda
- Journal Title
  
  Proc. of World Academy of Science
  
  Pages: 332-337
- NAID
  170000083049
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-17500014
[Journal Article] Unknotting is in AM ∩ co-AM2005
- Author(s)
  M.Hara, M.Yamamoto, S.Tani
- Journal Title
  
  Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithm
  
  Pages: 359-365
- NAID
  110003178737
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-14580391
[Journal Article] Unknotting is in AM ∩ co-AM.2005
- Author(s)
  M.Hara, M.Yamamoto, S.Tani
- Journal Title
  
  Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithm
  
  Pages: 359-365
- NAID
  110003178737
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-14580391
[Journal Article] Fast Algorithms for Computing Jones Polynomials of Certain Links2005
- Author(s)
  M. Murakami, M. Hara, M. Yamamoto, S. Tani
- Journal Title
  
  Proc.of 4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications
  
  Pages: 209-216
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-17500014
[Journal Article] Fast Algorithms for Computing Jones Polynomials of Certain Links2005
- Author(s)
  M.Murakami, M.Hara, M.Yamamoto, S.Tani
- Journal Title
  
  Proceedings of 4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications
  
  Pages: 209-216
- Data Source
  KAKENHI-PROJECT-17500014
[Journal Article] Fast Algorithms for Computing Jones Polynomial of Certain Links2005
- Author(s)
  Masahiko Murakami, Masao Hara, Makoto Yamamoto, Seiichi Tani
- Journal Title
  
  4^<th> Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications
  
  Pages: 209-216
- Data Source
  KAKENHI-PROJECT-17540135
[Journal Article] On Computational Complexity of the Conjugacy Problem for Braids2004
- Author(s)
  M.Matsuba, S.Tani
- Journal Title
  
  Technical Report of IEICE COMP-2003-88
  
  Pages: 17-23
- NAID
  110003178825
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-14580391
[Journal Article] On Computational Complexity of the Conjugacy Problem for Braids.2004
- Author(s)
  M.Matsuba, S.Tani
- Journal Title
  
  Technical Report of IEICE COMP-2003-88
  
  Pages: 17-23
- NAID
  110003178825
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-14580391
[Journal Article] Fast Algorithms for Computing Jones Polynomials of Certain Links.2004
- Author(s)
  M.Murakami, M.Kara, M.Yamamoto, S.Tani
- Journal Title
  
  Research Institute for Mathematical Sciences Vol.1375
  
  Pages: 174-180
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-14580391
[Journal Article] Fast Algorithms for Computing Jones Polynomials of Certain Links2004
- Author(s)
  M.Murakami, M.Hara, M.Yamamoto, S.Tani
- Journal Title
  
  京都大学数理解析研究所講究録 1375
  
  Pages: 174-180
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-14580391
[Journal Article] 学術論文関係情報のグラフ描画問題に基づく視覚化手法2003
- Author(s)
  宮寺庸造, 田地晶, 及部佳代子, 横山節雄, 近谷英昭, 夜久竹夫
- Journal Title
  
  電子情報通信学会論文誌 J87-D-I No.3
  
  Pages: 1-18
- NAID
  110003171316
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-14580391
[Journal Article] A Polynomial-Time Algorithms for Counting Graph Isomorphisms among Partial κ-Trees (in Japanese).2002
- Author(s)
  T.Nagoya, S.Tani, S.Toda
- Journal Title
  
  IEICE Transactions Vol.J85-D-I, No.5
  
  Pages: 424-435
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-14580391
[Journal Article] グラフ同型写像の数え上げ問題に対するアルゴリズムについて2002
- Author(s)
  名古屋孝幸, 谷聖一, 戸田誠之助
- Journal Title
  
  電子情報通信学会論文誌 J85-D-I No.5
  
  Pages: 424-435
- NAID
  110003184771
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-14580391
[Presentation] 大学入試を中心とした情報分野の学力評価手法の検討2023
- Author(s)
  植原啓介, 西田知博, 谷聖一, 安田豊, 坂東宏和, 高橋尚子, 角田博保, 萩原兼一
- Organizer
  第16回全国高等学校情報教育研究会全国大会（ポスター）
- Data Source
  KAKENHI-PROJECT-23H00068
[Presentation] 2橋絡み目のHOMFLY多項式を計算する高速なアルゴリズム2010
- Author(s)
  竹下文雄,谷聖一,村上雅彦
- Organizer
  コンピュテーション研究会
- Place of Presentation
  日東京工業大学
- Year and Date
  2010-06-25
- Data Source
  KAKENHI-PROJECT-20540092
[Presentation] O(n^2) time algorithms for computing Jones polynomials of certain links2009
- Author(s)
  村上雅彦,原正雄,谷聖一,山本慎
- Organizer
  研究集会「結び目の数学II」日本数学会トポロジー分科会・トポロジープロジェクト
- Place of Presentation
  早稲田大学
- Year and Date
  2009-12-23
- Data Source
  KAKENHI-PROJECT-20540092
[Presentation] O(n^2) time algorithms for computing Jones polynomials of certain links2009
- Author(s)
  村上雅彦, 原正雄, 谷聖一, 山本慎
- Organizer
  研究集会「結び目の数学II」
- Place of Presentation
  早稲田大学
- Year and Date
  2009-12-23
- Data Source
  KAKENHI-PROJECT-21500022
[Presentation] Google Maps API を利用した時空間分析ツールの試作-喜多村緑郎日記を対象として2008
- Author(s)
  松嶋慎太郎, 森井マスミ, 吉岡卓, 紅野謙介, 谷聖一
- Organizer
  情報処理学・人文科学とコンピュータ研究会第77回研究会発表会
- Place of Presentation
  東洋大学
- Data Source
  KAKENHI-PROJECT-17500014
[Presentation] Polynomial time algorithms for computing Jones polynomials of certain links2008
- Author(s)
  Masahiko Murakami, Masao Hara, Seiichi Tani, Makoto Yamamoto
- Organizer
  The 20th Workshop on Topological Graph Theory, Yokohama National University
- Year and Date
  2008-11-26
- Data Source
  KAKENHI-PROJECT-20540092
[Presentation] Google Maps APIを利用した時空間分析ツールの試作-喜多村緑郎日記を対象として2008
- Author(s)
  松嶋慎太郎, 森井マスミ, 吉岡卓, 紅野謙介, 谷聖一
- Organizer
  情報処理学・人文科学とコンピュータ研究会第77回研究会発表会
- Place of Presentation
  東洋大学
- Year and Date
  2008-01-25
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-17500014
[Presentation] Kolmogorov 記述量に基づく類似度距離による方言自動分類の試行2007
- Author(s)
  田中ゆかり, 谷聖一
- Organizer
  人文科学とコンピュータシンポジウムじんもんこん2007
- Place of Presentation
  京大会館
- Data Source
  KAKENHI-PROJECT-17500014
[Presentation] Fast Algorithms for Computing Jones Polynomials of Certain Links2007
- Author(s)
  M., Murakami, M., Hara, M., Yamamoto, S., Tani
- Organizer
  10th Korea-Japan Joint Workshop on Algorithms and Computation
- Place of Presentation
  Gwangju, Korea
- Year and Date
  2007-08-09
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-17500014
[Presentation] 喜多村緑郎文庫のデジタルアーカイブ化-多面的利用の可能性2007
- Author(s)
  森井マスミ, 吉岡卓, 谷聖一, 紅野謙介
- Organizer
  人文科学とコンピュータシンポジウムじんもんこん2007
- Place of Presentation
  京大会館
- Year and Date
  2007-12-13
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-17500014
[Presentation] Montesinos絡み目のJones多項式を計算するアルゴリズムについて2007
- Author(s)
  村上雅彦, 原正雄, 山本慎, 谷聖一
- Organizer
  京都大学数理解析研究所研究集会「計算機科学の理論とその応用」
- Place of Presentation
  同志社大学
- Year and Date
  2007-01-31
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-17500014
[Presentation] A Fast Algorithm for Computing Jones Polynomial of Montesinos Links2007
- Author(s)
  Masao, Hara, Masahiko, Murakami, Seiichi, Tani, Makoto, Yamamoto
- Organizer
  Kore-Japan Joint Workshop WAAC 2007
- Place of Presentation
  Chonnam National University Korea
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-17540135
[Presentation] A Fast Algorithm for Computing Jones Polynomials of Montesinos Links2007
- Author(s)
  M. Hara, M. Murakami, S. Tani and M. Yamamoto
- Organizer
  10th Korea-Japan Joint Workshop on Algorithms and Computation
- Place of Presentation
  Gwangju, Korea
- Data Source
  KAKENHI-PROJECT-17500014
[Presentation] Kolmogorov 記述量に基づく類似度距離を用いた方言自動分類の試み2007
- Author(s)
  谷聖一, 田中ゆかり
- Organizer
  計量国語学会第51回大会
- Place of Presentation
  日本大学
- Data Source
  KAKENHI-PROJECT-17500014
[Presentation] Kolmogorov記述量に基づく類似度距離を用いた方言自動分類の試み2007
- Author(s)
  谷聖一, 田中ゆかり
- Organizer
  計量国語学会第51回大会
- Place of Presentation
  日本大学
- Year and Date
  2007-09-29
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-17500014
[Presentation] A Fast Algorithm for Computing Jones Polynomials of Montesinos Links2007
- Author(s)
  M. Hara, M. Murakami, S. Tani, M. Yamamoto
- Organizer
  10th Korea-Japan Joint Workshop on Algorithms and Compputation
- Place of Presentation
  Gwangju,Korea
- Year and Date
  2007-08-09
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-17500014
[Presentation] Temporal Reasoning System for the Digital Theatre Library2007
- Author(s)
  S. Yoshioka, S. Tani, S. Toda, M. Morii, and K. Kohno
- Organizer
  11th IASTED International Conference on Inter-net and Multimedia Systems and Applications
- Place of Presentation
  Honolulu, Hawaii, USA
- Data Source
  KAKENHI-PROJECT-17500014
[Presentation] Kolmogorov記述量に基づく類似度距離による方言自動分類の試行2007
- Author(s)
  田中ゆかり, 谷聖一
- Organizer
  人文科学とコンピュータシンポジウムじんもんこん2007
- Place of Presentation
  京大会館
- Year and Date
  2007-12-13
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-17500014
[Presentation] Temporal Reasoning System for the Digital Theater Library2007
- Author(s)
  S., Yoshioka, S., Tani, S., Toda, M., Morii, K., Kohno
- Organizer
  11th of the TASTED Conference on Internet and Multimedia Systems and Applications
- Place of Presentation
  Honolulu, Hawaii, USA
- Year and Date
  2007-08-11
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-17500014
[Presentation] Extraction of temporal relation by the creation of historical natural disaster archive2006
- Author(s)
  S., Yoshioka, S., Tani, S., Toda
- Organizer
  XVI. International Conference on Computer and Information Science and Engineering
- Place of Presentation
  Venice, Italy
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-17500014
[Presentation] 新聞記事コーパスにおける自然災害の特性と時間関係の抽出2006
- Author(s)
  吉岡卓, 谷聖一, 戸田誠之助
- Organizer
  人文科学とコンピュータシンポジウムじんもんこん2006(ポスターセッション)
- Place of Presentation
  同志社大学
- Year and Date
  2006-12-15
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-17500014
[Presentation] 演劇資料アーカイブに対する年代推論システム2006
- Author(s)
  吉岡卓, 森井マスミ, 谷聖一, 紅野謙介, 戸田誠之助
- Organizer
  人文科学とコンピュータシンポジウムじんもんこん2006
- Place of Presentation
  同志社大学
- Year and Date
  2006-12-14
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-17500014
[Presentation] Fast Algorithms for Computing Jones Polynomials of Certain Links2005
- Author(s)
  M. Murakanu, M. Hara, M. Yamamoto, S. Tani
- Organizer
  4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications
- Place of Presentation
  Budapest,Hungary
- Year and Date
  2005-06-05
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-17500014
[Presentation] Fast Algorithms for Computing Jones Polynomials of Certain Links2005
- Author(s)
  Masahiko, Murakami, Masao, Hara, Makoto, Yamamoto, Seiichi, Tani
- Organizer
  4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications
- Place of Presentation
  Renyi Institute, Budapest Hungary
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-17540135

1. YAMAMOTO Makoto (10158305)

# of Collaborated Projects: 5 results

# of Collaborated Products: 25 results
2. TODA Seinosuke (90172163)

# of Collaborated Projects: 5 results

# of Collaborated Products: 11 results
3. YAKU Takeo (90102821)

# of Collaborated Projects: 5 results

# of Collaborated Products: 1 results
4. HARA Masao (10238165)

# of Collaborated Projects: 4 results

# of Collaborated Products: 21 results
5. SAITO Akira (90186924)

# of Collaborated Projects: 2 results

# of Collaborated Products: 0 results
6. MATSUMOTO Satoshi (30307235)

# of Collaborated Projects: 2 results

# of Collaborated Products: 0 results
7. ONISHI Kensuke (00303024)

# of Collaborated Projects: 2 results

# of Collaborated Products: 0 results
8. CHEN Zhi-zhong (00242933)

# of Collaborated Projects: 2 results

# of Collaborated Products: 0 results
9. KASAI Takumi (70027382)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
10. YAMAZAKI Koichi (00246662)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
11. IWATA Shigeki (80102028)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
12. WATE Masamichi (60059475)

# of Collaborated Projects: 1 results

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

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
14. 黒田耕嗣 (50153416)

# of Collaborated Projects: 1 results

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

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
16. 植原啓介 (30286629)

# of Collaborated Projects: 1 results

# of Collaborated Products: 1 results
17. 萩原兼一 (00133140)

# of Collaborated Projects: 1 results

# of Collaborated Products: 1 results
18. 西田知博 (00283820)

# of Collaborated Projects: 1 results

# of Collaborated Products: 1 results
19. 筧捷彦 (20062672)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
20. 安田豊 (30283899)

# of Collaborated Projects: 1 results

# of Collaborated Products: 1 results
21. 高橋尚子 (30459002)

# of Collaborated Projects: 1 results

# of Collaborated Products: 1 results
22. 坂東宏和 (50369039)

# of Collaborated Projects: 1 results

# of Collaborated Products: 1 results
23. 角田博保 (70152600)

# of Collaborated Projects: 1 results

# of Collaborated Products: 1 results
24. 中山泰一 (70251709)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
25. 辰己丈夫 (70257195)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
26. 中野由章 (80388686)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results

TANI Seiichi 谷 聖一

谷 聖一 タニ セイイチ

Research Projects

Research Products

Co-Researchers

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

On Computational Complexity of Computing Jones PolynomialsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

On computational complexity of computing polynomial invariants of linksPrincipal 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

Research Institution

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

[Book] アルゴリズムと計算量2005

Author(s)

Total Pages

Publisher

Description

Data Source

[Journal Article] O(n^2) time algorithms for computing Jones polynomials of certain links2010

Author(s)

Journal Title

Data Source

[Journal Article] Fast Algorithms for Computing Jones Polynomials of Montesinos Links2009

Author(s)

Journal Title

NAID

Data Source

[Journal Article] Fast Algorithms for Computing Jones Polynomials of Certain Links2007

Author(s)

Journal Title

Description

Data Source

[Journal Article] A Fast Algorithm for Computing Jones Polynomials of Montesinos Links2007

Author(s)

Journal Title

NAID

TANI Seiichi 谷聖一

谷聖一タニセイイチ