可满足性问题算法研究CNF的简化.pdfVIP

  • 119
  • 0
  • 约3.97万字
  • 约 40页
  • 2017-07-04 发布于未知
  • 举报
目 录 摘要·······························································1 Abstract···························································2 弓I.言···················-···········································3 第一章绪论························································4 第一节时间复杂度··············································4 第二节关于NP问题·············································5 第三节可满足性问题············································5 第四节逻辑电路与CNF式································一···一·6 第五节本文的思路和组织架构···········一一“········一一”一“

文档评论(0)

1亿VIP精品文档

相关文档