期刊论文、会议论文

Zhou, Kang

英文

Communications in Computer and Information Science

1865-0929

2014

472

83-87

9th International Conference on Bio-Inspired Computing - Theories and Applications (BIC-TA)

Communications in Computer and Information Science

OCT 16-19, 2014

Wuhan, PEOPLES R CHINA

[Dai, Peng;Zhou, Kang;Wei, Zhiwei;Hu, Di;Liu, Chun] Wuhan Polytech Univ, Sch Math & Comp, Wuhan, Peoples R China.

Natl Nat Sci Fdn China, Huazhong Univ Sci &Technol, Zhengzhou Univ Light Ind

Pan, L Paun, G PerezJimenez, MJ Song, T

HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY

SPRINGER-VERLAG BERLIN

978-3-662-45048-2

10.1007/978-3-662-45049-9_14

本校为第一且通讯机构

Satisfiability problem (SAT) is one of classical combinational problems, which is proved to be a famous NP-complete problem [1]. SAT is widely used [2], [3]. At present, research on algorithm of SAT has made significant progress [4], [5]. Among these algorithms, some are non polynomial even though they can obtain exact solution of SAT; and heuristic algorithm cannot obtain exact solution of SAT, even though it is polynomial. Therefore, it is essential to find an exact algorithm of SAT which is more...