Ruiz, Dato and Manuel, Juan (2022) SAT in P Does Not Imply Chaos in the Security System. Journal of Computer and Communications, 10 (10). pp. 122-148. ISSN 2327-5219
![[thumbnail of jcc_2022102711560982.pdf]](http://publications.article4sub.com/style/images/fileicons/text.png)
Text
jcc_2022102711560982.pdf - Published Version
Download (1MB)
Official URL: https://doi.org/10.4236/jcc.2022.1010009
Abstract
There are a large number of papers that claim that there are problems that once solved lead to an efficient solution of a wide range of problems, classified as NP. In this paper we will not only question the existence of this class of NP-co problems, but we will also explain their limitations in engineering and give a polynomial-time solution to SAT, one of these emblematic problems. The resolution will be so trivial that it will even be possible to practice it on paper.
| Item Type: | Article |
|---|---|
| Subjects: | Academic Digital Library > Computer Science |
| Depositing User: | Unnamed user with email info@academicdigitallibrary.org |
| Date Deposited: | 04 May 2023 05:30 |
| Last Modified: | 02 Feb 2024 04:22 |
| URI: | http://publications.article4sub.com/id/eprint/1373 |
Actions (login required)
- View Item