P = NP preprint
P = NP preprint
This file presents a preprint of a proposed proof that P = NP by providing a polynomial-time algorithm for the Positive 1-in-3 SAT problem. I aimed to convey that, in the absence of duplicate variables and clauses, the maximum number of clauses depends on nnn, which creates the possibility of a "threshold" beyond which the formula becomes UNSAT. Three main cases are identified, covering the entire family of Positive 1-in-3 SAT instances, two of which can be solved in constant time, and the third in polynomial time. I am not certain to what extent I have been able to translate my thoughts into formal language, but I hope that the direction of my idea will be clear.
algorithm, theoretical computer science, polynomial time, Positive 1-in-3 SAT, complexity theory, P=NP
algorithm, theoretical computer science, polynomial time, Positive 1-in-3 SAT, complexity theory, P=NP
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!