Article citationsMore>>

Fagin, R. (1974) Generalized First-Order Spectra and Polynomial-Time Recognizable Sets. In: Society for Industrial and Applied Mathematics, Ed., Complexity of Computation, American Mathematical Society, Providence, 27-41.

has been cited by the following article:

• TITLE: SAT in P Does Not Imply Chaos in the Security System

  AUTHORS: Dato Ruiz, Juan Manuel

  KEYWORDS: NP-Co Problems, SAT, Polynomial-Time Solution

  JOURNAL NAME: Journal of Computer and Communications, Vol.10 No.10, October 28, 2022

  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.