The parallel complexity of combinatorial problems
Available with Digitized Contents Transmission Service
Find on the publisher's website
国立国会図書館デジタルコレクション
Available for viewing via the Digitized Contents Transmission Service for Individuals to official registered users of the NDL, who resides in Japan.
Search by Bookstore
Read this material in an accessible format.
Table of Contents
Abstract
p1
Contents
p1
1 Introduction
p3
2 NC and P-Completeness
p10
2.1 Circuit Complexity and the Class NC
p10
Search by Bookstore
Read in Disability Resources
- Mina Search
- プレーンテキスト
Registered users of Mina Search can download or stream this content.
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.
- Material Type
- 博士論文
- Author/Editor
- 正代隆義 [著]
- Author Heading
- 正代, 隆義 ショウダイ, タカヨシ ( 001094393 )Authorities
- Alternative Title
- 組合せ問題の並列計算量 クミアワセ モンダイ ノ ヘイレツ ケイサンリョウ
- Degree grantor/type
- 九州大学
- Date Granted
- 平成5年9月27日
- Date Granted (W3CDTF)
- 1993
- Dissertation Number
- 乙第5500号
- Degree Type
- 博士 (理学)