DSpace About DSpace Software
個性を持った自立的な人間の創造
    
日本語
 

SEIKEI University Repository >
01:紀要(Bulletin) >
09:理工学研究報告 >
第49巻第2号 >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10928/290

Title: 充足可能性問題のアルゴリズム
Other Titles: Algorithms for the satisfiability problem
Authors: 山本, 真基
YAMAMOTO, Masaki
Keywords: algorithm
satisfiability problem
NP-hard
Issue Date: 1-Dec-2012
Publisher: 成蹊大学理工学部
Abstract: The satisfiability problem (SAT problem for short) is a computational problem, such as the traveling salesman problem. It is a fundamental problem in theoretical computer science. We present the background of the SAT problem as well as typical algorithms for solving the problem. The main purpose of this paper is to introduce one of my research work.
URI: http://hdl.handle.net/10928/290
Appears in Collections:第49巻第2号

Files in This Item:

File Description SizeFormat
rikougaku-49-2_51-54.pdf640.98 kBAdobe PDFView/Open

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

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback