Skip to main content
/
Memedia
/
Group items tagged np
Group items tagged
Filter:
All
|
Bookmarks
|
Topics
Simple
Middle
扫雷是NP完全问题 @ 阅微堂
- 0 views
zhiqiang.org/...inesweeper-is-np-complete.html
computing
np
复杂
计算
shared by
isaac Mao
on 12 Jun 08
-
Cached
结果于2000年发表在Mathematical Intelligencer上,论文题目是Minesweeper is NP-complete,这里有作者的简单的问题和证明介绍。证明方法是证明扫雷问题可以编码任何逻辑电路,包括NP-hard的3SAT问题。作者还有一个非常直观的PPT演示证明过程,比如下图展示如何编码AND逻辑门:
...
Cancel
...
Cancel
...
Cancel
1
-
1
of
1
Showing
20
▼
items per page
20
50
100
Related searches
Search
np
matching in title, tags, annotations and url of group items »
Search in Google »