Access count of this item: 56

Files in This Item:
File Description SizeFormat 
yjohk00062.pdfAbstract_要旨215.85 kBAdobe PDFView/Open
Title: Combinatorial Structures in Finite Automata, CNF Satisfiability and Arithmetic Computation
Other Titles: 有限オートマトン,CNF論理式の充足可能性問題,算術計算に現れる組合せ的構造
Authors: Matsuura, Akihiro
Author's alias: 松浦, 昭洋
Issue Date: 25-Nov-2002
Publisher: 京都大学 (Kyoto University)
Conferring University: Kyoto University (京都大学)
Degree Level: 新制・課程博士
Degree Discipline: 博士(情報学)
Degree Report no.: 甲第9847号
Degree no.: 情博第62号
Degree Call no.: 新制||情||16(附属図書館)
Degree Affiliation: 京都大学大学院情報学研究科通信情報システム専攻
Examination Committee members: (主査)教授 岩間 一雄, 教授 富田 眞治, 教授 湯淺 太一
Provisions of the Ruling of Degree: 学位規則第4条第1項該当
URI: http://hdl.handle.net/2433/149387
Appears in Collections:Doctoral Dissertation (Informatics)

Show full item record

Export to RefWorks


Export Format: 


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.