arXiv
Open Access
2021
On the complexity of SAT
Fabio Romano
Abstrak
In this paper, we prove that no deterministic algorithm can solve SAT in polynomial time in the number of boolean variables.
Penulis (1)
F
Fabio Romano
Akses Cepat
Informasi Jurnal
- Tahun Terbit
- 2021
- Bahasa
- en
- Sumber Database
- arXiv
- Akses
- Open Access ✓