A Refutation of Guinea's "Understanding SAT is in P"
classification
💻 cs.CC
keywords
guineaunderstandingalejandroalgorithmanchezarxivclaimscritique
read the original abstract
In this work, we summarize and critique the paper "Understanding SAT is in P" by Alejandro S\'anchez Guinea [arXiv:1504.00337]. The paper claims to present a polynomial-time solution for the NP-complete language 3-SAT. We show that Guinea's algorithm is flawed and does not prove 3-SAT is in P.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.