期刊文献+

Some Structural Properties of SAT

Some Structural Properties of SAT
原文传递
导出
摘要 The following four conjectures about structural properties of SAT are studied in this paper. (1) SAT ∈ PSPARSEnNP; (2) SAT ∈ SRTDtt; (3) SAT ∈ PttbAPP; (4) FPttSAT = FPlogSAT. It is proved that some pairs of these conjectures imply P = NP, for example, if SAT E pSPARsEnNP and SAT 6 PttbAPP, or if SAT E SRTDtt and SAT E PttbAPP, then P = NP. This improves previous results in literature. The following four conjectures about structural properties of SAT are studied in this paper. (1) SAT ∈ PSPARSEnNP; (2) SAT ∈ SRTDtt; (3) SAT ∈ PttbAPP; (4) FPttSAT = FPlogSAT. It is proved that some pairs of these conjectures imply P = NP, for example, if SAT E pSPARsEnNP and SAT 6 PttbAPP, or if SAT E SRTDtt and SAT E PttbAPP, then P = NP. This improves previous results in literature.
作者 刘田
出处 《Journal of Computer Science & Technology》 SCIE EI CSCD 2000年第5期439-444,共6页 计算机科学技术学报(英文版)
基金 This work is supported by the key project fund of China's Ninth Fivesyear Plan and the Science Foundation of Peking University
关键词 structural complexity SAT sparse set approximable set truthtable reduction non-adaptive search reducible to decision. structural complexity, SAT, sparse set, approximable set, truthtable reduction, non-adaptive search reducible to decision.
  • 相关文献

参考文献1

  • 1Wang Y,http: / /www. eccc. uni-trier. de/eccc /,1996年

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部