On the Complexity of Subproblems of SAT (New Developments of Theory of Computation and Algorithms)
Bibliographic Information
- Other Title
-
- SATのいくつかの部分問題の複雑さについて (計算理論とアルゴリズムの新展開)
- On the Complexity of Subproblems of SAT
Search this article
Journal
-
- 数理解析研究所講究録
-
数理解析研究所講究録 1205 113-118, 2001-05
京都大学数理解析研究所
- Tweet
Details 詳細情報について
-
- CRID
- 1050001202060949248
-
- NII Article ID
- 110000165362
-
- NII Book ID
- AN00061013
-
- ISSN
- 18802818
-
- HANDLE
- 2433/41010
-
- NDL BIB ID
- 5828429
-
- Text Lang
- en
-
- Article Type
- departmental bulletin paper
-
- Data Source
-
- IRDB
- NDL
- CiNii Articles