The cover of this title could differ from library to library.

The cover of this title could differ from library to library.

Read via the Internet

Begin reading now

国立国会図書館デジタルコレクション

Computational complexity of boolean formulas with query symbols

Call No. (NDL): UT51-2000-C793
Bibliographic ID of National Diet Library: 000000350108
Persistent ID (NDL): info:ndljp/pid/3164916

Material type: 博士論文

Author: 鈴木登志雄 [著]

Publisher: -

Publication date: -

Material Format: Paper・Digital

Capacity, size, etc.: -

Name of awarding university/degree: 筑波大学,博士 (理学)

Notes on use

Note (General)：: 博士論文

Search by Bookstore

Search by Bookstore

Read this material in an accessible format.

View materials in accessible formats for people with print disabilities (1Type)

Table of Contents

Contents
p1
Preface
p3
Acknowledgement
p5
1 Introduction
p1
1.1 Forcing complexity and historical background
p1

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.

Paper Digital

Material Type: 博士論文
Title: Computational complexity of boolean formulas with query symbols
Author/Editor: 鈴木登志雄 [著]
Author Heading: 鈴木, 登志雄スズキ, トシオ
Alternative Title: クエリー記号付きブール式の計算複雑さクエリーキゴウツキブールシキノケイサンフクザツサ
Degree grantor/type: 筑波大学
Date Granted: 平成11年3月25日
Date Granted (W3CDTF): 1999
Dissertation Number: 乙第1498号
Degree Type: 博士 (理学)
Note (Dissertation): 博士論文
Place of Publication (Country Code): JP
NDLC: UT51
Note (General): 博士論文
Holding library: 国立国会図書館
Call No.: UT51-2000-C793
Data Provider (Database): 国立国会図書館 : 国立国会図書館蔵書
https://ndlsearch.ndl.go.jp
Bibliographic ID (NDL): 000000350108
http://id.ndl.go.jp/bib/000000350108
Bibliographic Record Category (NDL): 213