加载中…
2021-11-02
On the complexity of SAT
Fabio Romano
文献摘要
In this paper, we prove that no deterministic algorithm can solve SAT in polynomial time in the number of boolean variables.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本
In this paper, we prove that no deterministic algorithm can solve SAT in polynomial time in the number of boolean variables.
生成讲解博客的中文版本
生成AI智能校验的中文版本