P Versus NP Problem Solution

Logic Analysis
Seun Adedokun

Abstract This electronic document is a live template. The

various components of your paper [title, text, heads, etc.] are
already defined on the style sheet, as illustrated by the portions
given in this document.

I. INTRODUCTION
This is manuscript 3 of my solution to the P versus
NP problem I formulate the Seun Adedokun Polynomial
Algorithm as the Polynomial algorithm which is a solution
to the P versus NP problems that asks if a question that
can be quickly verified by a computer can be solved by the
computer
I also explain the significant advantage of the practical
analysis of the seun Adedokun Polynomial algoroithm over
the Binary decision diagram analysis
I also explain the significant advantage of the Seun Adedokun Polynomial algorithm over the Dpll algorithm based
on the fact that the Seun Adedokun Polynomial algorithm
that i formulate runs in polynomial time as the solution to
the boolean satisfiability criterion
II. S EUN A DEDOKUN P OLYNOMIAL A LGORITHM
III. B INARY D ECISION D IAGRAM
I explain the significant advantage of the Seun Adedokun
Polynomial algorithm over the binary decision diagram
where fora binary decision tree and a truth table i explain
the practical analysis scenario where the seun adedokun
polynomial algorithm runs in polynomial time which is
significantly better than the binary decision diagram analysis
A binary decision tree is shown below
The Seun Adedokun Polynomial algorithm of the binary
decision diagram of the binary decision tree
it is observed from the figure of teh binary decision
diagram that there is a single isomorphism from the oberved
truth table representation but for my formulation of the
Seun Adedokun Polynomial algorithm of the binary decision diagram there are two isomorphisms in the truth table

representation which means that the algorithm will rum in

polynomial time and also for the truth table representation
with inputs x1 x2 x3 i can get two isomorphisms in the
logical representation of the output compared to a single
isomorphism of the binary decision diagram which means
the algorithm will run twice as faster for the 8 boolean
representation of inputs x1 x2 x3
A. Abbreviations and Acronyms
Define abbreviations and acronyms the first time they are
used in the text, even after they have been defined in the
abstract. Abbreviations such as IEEE, SI, MKS, CGS, sc, dc,
and rms do not have to be defined. Do not use abbreviations
in the title or heads unless they are unavoidable.
IV. D PLL A LGORITHM
I explain the significant advantage of the Seun Adedokun
polynomial algorithm over the dpll algorithm and i formulate
the Seun Adedokun polynomial algorithm
Dpll algorithm is a backtracking based search algorithm for
deciding the satisfiability of propositional logic formulae in
conjunctive normal form The basic backtracking algorithm
runs by choosing a literal assigning a truth value to it
simplifying the formula and then recursively checking if
the simplified formula is satisfiable if this is the case the
original formula is satisfiable otherwise the same recursive
check is done assuming the opposite truth value since the
Sat problem is an Np complete problem only algorithms
with an exponential worst case complexity is known for
it I therefore formulate the Seun Adedokun Polynomial
Algorithm which runs in a polynomial time and I satisfy
the boolean satisfiabilty condition for the solution of the P
versus NP problem
DPLL Algorithm
Algorithm DPLL
Input: A set of clauses .
Output: A Truth Value.
function DPLL()
if is a consistent set of literals
then return true;
if contains an empty clause
then return false;
for every unit clause l in
unit-propagate(l, );
for every literal l that occurs pure in
pure-literal-assign(l, );
l choose-literal();
return DPLL( l) or DPLL( not(l));
the Dpll algorithm enhances over the backtracking algorithm based on the concept unit propagation and pure literal
analysis
The analysis of unit propagation is based on the fact that
if a clause is a unit clause it has a single unassigned literal
where the clause can be made satisfiable by assigning the
value to make the literal true
Pure polarity analysis is based on the fact that a propositional

variable has one polarity in the formula and the literal can
be assigned in such a way that will make the clause true
The Seun Adedokun Polynomial Algorithm is significantly
better than than the Dppl Algorithm in that the logical
expression will not return an empty clause as it will always
return the truth value
Seun Adedokun Polynomial Algorithm Input: A set of
clauses .
Output: A Truth Value.
function DPLL()
if is a consistent set of literals
then return true;
for every unit clause l in
unit-propagate(l, );
for every literal l that occurs pure in
pure-literal-assign(l, );
l choose-literal();
return DPLL( l)
An example with the analysis of the dpll algorithm is
shown in the figure based on the truthfulness and falsehood
analysis of the propositional variables a b c
Based on the analysis the Dpll algorithm with chronological backtracking is 11 steps before the final implication graph
is reached but the Seun Adedokun Polynomial algorithm is
4 steps i therefore show that the Seun Adedokun Polynomial
algorithm runs in polynomial time
The Seun Adedokun Polynomial algorithm for the impli-

cation graph analysis is 4 steps and there is no conflict

V. C OMPUTATIONAL C OMPLEXITY
I have analyzed the computational complexity and that the
seun adedokun polynomial algorithm is significantly better
than the binary decision diagram and the dpll algorithm
I explained the fact that the seun adedokun polynomial
algorithm has two isomorphisms for the binary decision
diagram example which makes it twice faster than the binary
decision diagram of the binary decision trees
I have also explained the fact that the Seun Adedokun
Polynomial Algorithm for the implication graph analysis is
4 steps and there is no conflict which is significantly better
than the 11 steps of the dpll algorithm This shows that the
Seun Adedokun Polynomial algorithm that i formulate runs
in polynomial time
VI. CONCLUSIONS
This is manuscript 3 of my solution to the P versus
NP problem I formulate the Seun Adedokun Polynomial
Algorithm as the Polynomial algorithm which is a solution

to the P versus NP problems that asks if a question that

can be quickly verified by a computer can be solved by the
computer
I explain the Seun Adedokun Polynomial Algorithm that i
formulate and the fact that the Seun Adedokun Polynomial
algorithm runs in polynomial time and that the Seun Adedokun Polynomial algorithm is significantly better than the
Binary decision diagram and that the Seun Adedokun Polynomial Algorithm is significantly better than the Binary decision diagram in terms of computational complexity analysis
i explain the fact that teh Seun Adedokun Polynomial Algorithm is significantly better than the Dpll algorithm and that
the Seun Adedokun Polynomial Algorithm is significantly
better than the Dpll Algorithm in terms of computational
complexity analysis
APPENDIX
Appendixes should appear before the acknowledgment.
ACKNOWLEDGMENT
The preferred spelling of the word acknowledgment in
America is without an e after the g. Avoid the stilted
expression, One of us (R. B. G.) thanks . . . Instead, try R. B.
G. thanks. Put sponsor acknowledgments in the unnumbered
footnote on the first page.
References are important to the reader; therefore, each
citation must be complete and correct. If at all possible,
references should be commonly available publications.
R EFERENCES
[1] question on the Boolean Satisfiablity criterion