search

tinsir888 / tinsir888.github.io-gittalk

Open Comment for Personal Blog
GNU General Public License v3.0
0 stars 0 forks source link

算法和计算复杂度 14 SAT Problem | min hjemmeside #301

Open tinsir888 opened 2 weeks ago

tinsir888 commented 2 weeks ago

https://tinsir888.github.io/posts/58f23662.html?

Boolean satisfiability is prototypical NPNPNP-complete problem. There is no algorithm deciding SATSATSAT in worst case in polynomial time unless P=NPP