On the computational complexity of satisfiability problems

On the computational complexity of satisfiability problems

Call No. (NDL): UT51-2006-R375
Bibliographic ID of National Diet Library: 000008443356

Material type: 博士論文

Author: Masaki Yamamoto [著]

Publisher: [Masaki Yamamoto]

Publication date: [2006]

Material Format: Paper

Capacity, size, etc.: 1冊

Name of awarding university/degree: 東京工業大学,博士 (理学)

Notes on use

Note (General)：: 博士論文

Search by Bookstore

Search by Bookstore

Search by Bookstore

Bibliographic Record

You can check the details of this material, its authority (keywords that refer to materials on the same subject, author's name, etc.), etc.

Paper

Material Type: 博士論文
Title: On the computational complexity of satisfiability problems
Author/Editor: Masaki Yamamoto [著]
Author Heading: 山本, 真基ヤマモト, マサキ
Publication, Distribution, etc.: [Masaki Yamamoto]
Publication Date: [2006]
Publication Date (W3CDTF): 2006
Extent: 1冊
Alternative Title: 充足可能性問題の計算量についてジュウソクカノウセイモンダイノケイサンリョウニツイテ
Degree grantor/type: 東京工業大学
Date Granted: 平成18年3月26日
Date Granted (W3CDTF): 2006
Dissertation Number: 甲第6385号
Degree Type: 博士 (理学)
Note (Dissertation): 博士論文
Place of Publication (Country Code): JP
Text Language Code: eng
NDLC: UT51
Note (General): 博士論文
Holding library: 国立国会図書館
Call No.: UT51-2006-R375
Data Provider (Database): 国立国会図書館 : 国立国会図書館蔵書
https://ndlsearch.ndl.go.jp
Bibliographic ID (NDL): 000008443356
http://id.ndl.go.jp/bib/000008443356
Bibliographic Record Category (NDL): 213