\documentclass[11pt,twoside]{article}\makeatletter

\IfFileExists{xcolor.sty}%
  {\RequirePackage{xcolor}}%
  {\RequirePackage{color}}
\usepackage{colortbl}
\usepackage{wrapfig}
\usepackage{ifxetex}
\ifxetex
  \usepackage{fontspec}
  \usepackage{xunicode}
  \catcode`⃥=\active \def⃥{\textbackslash}
  \catcode`❴=\active \def❴{\{}
  \catcode`❵=\active \def❵{\}}
  \def\textJapanese{\fontspec{Noto Sans CJK JP}}
  \def\textChinese{\fontspec{Noto Sans CJK SC}}
  \def\textKorean{\fontspec{Noto Sans CJK KR}}
  \setmonofont{DejaVu Sans Mono}
  
\else
  \IfFileExists{utf8x.def}%
   {\usepackage[utf8x]{inputenc}
      \PrerenderUnicode{–}
    }%
   {\usepackage[utf8]{inputenc}}
  \usepackage[english]{babel}
  \usepackage[T1]{fontenc}
  \usepackage{float}
  \usepackage[]{ucs}
  \uc@dclc{8421}{default}{\textbackslash }
  \uc@dclc{10100}{default}{\{}
  \uc@dclc{10101}{default}{\}}
  \uc@dclc{8491}{default}{\AA{}}
  \uc@dclc{8239}{default}{\,}
  \uc@dclc{20154}{default}{ }
  \uc@dclc{10148}{default}{>}
  \def\textschwa{\rotatebox{-90}{e}}
  \def\textJapanese{}
  \def\textChinese{}
  \IfFileExists{tipa.sty}{\usepackage{tipa}}{}
\fi
\def\exampleFont{\ttfamily\small}
\DeclareTextSymbol{\textpi}{OML}{25}
\usepackage{relsize}
\RequirePackage{array}
\def\@testpach{\@chclass
 \ifnum \@lastchclass=6 \@ne \@chnum \@ne \else
  \ifnum \@lastchclass=7 5 \else
   \ifnum \@lastchclass=8 \tw@ \else
    \ifnum \@lastchclass=9 \thr@@
   \else \z@
   \ifnum \@lastchclass = 10 \else
   \edef\@nextchar{\expandafter\string\@nextchar}%
   \@chnum
   \if \@nextchar c\z@ \else
    \if \@nextchar l\@ne \else
     \if \@nextchar r\tw@ \else
   \z@ \@chclass
   \if\@nextchar |\@ne \else
    \if \@nextchar !6 \else
     \if \@nextchar @7 \else
      \if \@nextchar (8 \else
       \if \@nextchar )9 \else
  10
  \@chnum
  \if \@nextchar m\thr@@\else
   \if \@nextchar p4 \else
    \if \@nextchar b5 \else
   \z@ \@chclass \z@ \@preamerr \z@ \fi \fi \fi \fi
   \fi \fi  \fi  \fi  \fi  \fi  \fi \fi \fi \fi \fi \fi}
\gdef\arraybackslash{\let\\=\@arraycr}
\def\@textsubscript#1{{\m@th\ensuremath{_{\mbox{\fontsize\sf@size\z@#1}}}}}
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\def\abbr{}
\def\corr{}
\def\expan{}
\def\gap{}
\def\orig{}
\def\reg{}
\def\ref{}
\def\sic{}
\def\persName{}\def\name{}
\def\placeName{}
\def\orgName{}
\def\textcal#1{{\fontspec{Lucida Calligraphy}#1}}
\def\textgothic#1{{\fontspec{Lucida Blackletter}#1}}
\def\textlarge#1{{\large #1}}
\def\textoverbar#1{\ensuremath{\overline{#1}}}
\def\textquoted#1{‘#1’}
\def\textsmall#1{{\small #1}}
\def\textsubscript#1{\@textsubscript{\selectfont#1}}
\def\textxi{\ensuremath{\xi}}
\def\titlem{\itshape}
\newenvironment{biblfree}{}{\ifvmode\par\fi }
\newenvironment{bibl}{}{}
\newenvironment{byline}{\vskip6pt\itshape\fontsize{16pt}{18pt}\selectfont}{\par }
\newenvironment{citbibl}{}{\ifvmode\par\fi }
\newenvironment{docAuthor}{\ifvmode\vskip4pt\fontsize{16pt}{18pt}\selectfont\fi\itshape}{\ifvmode\par\fi }
\newenvironment{docDate}{}{\ifvmode\par\fi }
\newenvironment{docImprint}{\vskip 6pt}{\ifvmode\par\fi }
\newenvironment{docTitle}{\vskip6pt\bfseries\fontsize{22pt}{25pt}\selectfont}{\par }
\newenvironment{msHead}{\vskip 6pt}{\par}
\newenvironment{msItem}{\vskip 6pt}{\par}
\newenvironment{rubric}{}{}
\newenvironment{titlePart}{}{\par }

\newcolumntype{L}[1]{){\raggedright\arraybackslash}p{#1}}
\newcolumntype{C}[1]{){\centering\arraybackslash}p{#1}}
\newcolumntype{R}[1]{){\raggedleft\arraybackslash}p{#1}}
\newcolumntype{P}[1]{){\arraybackslash}p{#1}}
\newcolumntype{B}[1]{){\arraybackslash}b{#1}}
\newcolumntype{M}[1]{){\arraybackslash}m{#1}}
\definecolor{label}{gray}{0.75}
\def\unusedattribute#1{\sout{\textcolor{label}{#1}}}
\DeclareRobustCommand*{\xref}{\hyper@normalise\xref@}
\def\xref@#1#2{\hyper@linkurl{#2}{#1}}
\begingroup
\catcode`\_=\active
\gdef_#1{\ensuremath{\sb{\mathrm{#1}}}}
\endgroup
\mathcode`\_=\string"8000
\catcode`\_=12\relax

\usepackage[a4paper,twoside,lmargin=1in,rmargin=1in,tmargin=1in,bmargin=1in,marginparwidth=0.75in]{geometry}
\usepackage{framed}

\definecolor{shadecolor}{gray}{0.95}
\usepackage{longtable}
\usepackage[normalem]{ulem}
\usepackage{fancyvrb}
\usepackage{fancyhdr}
\usepackage{graphicx}
\usepackage{marginnote}

\renewcommand{\@cite}[1]{#1}


\renewcommand*{\marginfont}{\itshape\footnotesize}

\def\Gin@extensions{.pdf,.png,.jpg,.mps,.tif}

  \pagestyle{fancy}

\usepackage[pdftitle={P ? NP Proof (Millennium Prize Problem Solved using the Proof of X ± Y = B at System 1)},
 pdfauthor={}]{hyperref}
\hyperbaseurl{}

	 \paperwidth210mm
	 \paperheight297mm
              
\def\@pnumwidth{1.55em}
\def\@tocrmarg {2.55em}
\def\@dotsep{4.5}
\setcounter{tocdepth}{3}
\clubpenalty=8000
\emergencystretch 3em
\hbadness=4000
\hyphenpenalty=400
\pretolerance=750
\tolerance=2000
\vbadness=4000
\widowpenalty=10000

\renewcommand\section{\@startsection {section}{1}{\z@}%
     {-1.75ex \@plus -0.5ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large\bfseries}}
\renewcommand\subsection{\@startsection{subsection}{2}{\z@}%
     {-1.75ex\@plus -0.5ex \@minus- .2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large}}
\renewcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}%
     {-1.5ex\@plus -0.35ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\large}}
\renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}%
     {-1ex \@plus-0.35ex \@minus -0.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\normalsize}}
\renewcommand\subparagraph{\@startsection{subparagraph}{5}{\parindent}%
     {1.5ex \@plus1ex \@minus .2ex}%
     {-1em}%
     {\reset@font\normalsize\bfseries}}


\def\l@section#1#2{\addpenalty{\@secpenalty} \addvspace{1.0em plus 1pt}
 \@tempdima 1.5em \begingroup
 \parindent \z@ \rightskip \@pnumwidth 
 \parfillskip -\@pnumwidth 
 \bfseries \leavevmode #1\hfil \hbox to\@pnumwidth{\hss #2}\par
 \endgroup}
\def\l@subsection{\@dottedtocline{2}{1.5em}{2.3em}}
\def\l@subsubsection{\@dottedtocline{3}{3.8em}{3.2em}}
\def\l@paragraph{\@dottedtocline{4}{7.0em}{4.1em}}
\def\l@subparagraph{\@dottedtocline{5}{10em}{5em}}
\@ifundefined{c@section}{\newcounter{section}}{}
\@ifundefined{c@chapter}{\newcounter{chapter}}{}
\newif\if@mainmatter 
\@mainmattertrue
\def\chaptername{Chapter}
\def\frontmatter{%
  \pagenumbering{roman}
  \def\thechapter{\@roman\c@chapter}
  \def\theHchapter{\roman{chapter}}
  \def\thesection{\@roman\c@section}
  \def\theHsection{\roman{section}}
  \def\@chapapp{}%
}
\def\mainmatter{%
  \cleardoublepage
  \def\thechapter{\@arabic\c@chapter}
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \pagenumbering{arabic}
  \setcounter{secnumdepth}{6}
  \def\@chapapp{\chaptername}%
  \def\theHchapter{\arabic{chapter}}
  \def\thesection{\@arabic\c@section}
  \def\theHsection{\arabic{section}}
}
\def\backmatter{%
  \cleardoublepage
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \setcounter{secnumdepth}{2}
  \def\@chapapp{\appendixname}%
  \def\thechapter{\@Alph\c@chapter}
  \def\theHchapter{\Alph{chapter}}
  \appendix
}
\newenvironment{bibitemlist}[1]{%
   \list{\@biblabel{\@arabic\c@enumiv}}%
       {\settowidth\labelwidth{\@biblabel{#1}}%
        \leftmargin\labelwidth
        \advance\leftmargin\labelsep
        \@openbib@code
        \usecounter{enumiv}%
        \let\p@enumiv\@empty
        \renewcommand\theenumiv{\@arabic\c@enumiv}%
	}%
  \sloppy
  \clubpenalty4000
  \@clubpenalty \clubpenalty
  \widowpenalty4000%
  \sfcode`\.\@m}%
  {\def\@noitemerr
    {\@latex@warning{Empty `bibitemlist' environment}}%
    \endlist}

\def\tableofcontents{\section*{\contentsname}\@starttoc{toc}}
\parskip0pt
\parindent1em
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\newenvironment{reflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemsep}{0pt}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\itshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{sansreflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\itemsep}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\upshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{specHead}[2]%
 {\vspace{20pt}\hrule\vspace{10pt}%
  \phantomsection\label{#1}\markright{#2}%

  \pdfbookmark[2]{#2}{#1}%
  \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}%
  }{}
      \def\TheFullDate{2014-01-15 (revised: 15 January 2014)}
\def\TheID{\makeatother }
\def\TheDate{2014-01-15}
\title{P ? NP Proof (Millennium Prize Problem Solved using the Proof of X ± Y = B at System 1)}
\author{}\makeatletter 
\makeatletter
\newcommand*{\cleartoleftpage}{%
  \clearpage
    \if@twoside
    \ifodd\c@page
      \hbox{}\newpage
      \if@twocolumn
        \hbox{}\newpage
      \fi
    \fi
  \fi
}
\makeatother
\makeatletter
\thispagestyle{empty}
\markright{\@title}\markboth{\@title}{\@author}
\renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@
\belowdisplayskip \abovedisplayskip
\abovedisplayshortskip \z@ plus2\p@
\belowdisplayshortskip 4\p@ plus2\p@ minus2\p@
\def\@listi{\leftmargin\leftmargini
               \topsep 2\p@ plus1\p@ minus1\p@
               \parsep 2\p@ plus\p@ minus\p@
               \itemsep 1pt}
}
\makeatother
\fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm}
\fancyhf{} 
\setlength{\headheight}{14pt}
\fancyhead[LE]{\bfseries\leftmark} 
\fancyhead[RO]{\bfseries\rightmark} 
\fancyfoot[RO]{}
\fancyfoot[CO]{\thepage}
\fancyfoot[LO]{\TheID}
\fancyfoot[LE]{}
\fancyfoot[CE]{\thepage}
\fancyfoot[RE]{\TheID}
\hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true}
\fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}}

\date{}
\usepackage{authblk}

\providecommand{\keywords}[1]
{
\footnotesize
  \textbf{\textit{Index terms---}} #1
}

\usepackage{graphicx,xcolor}
\definecolor{GJBlue}{HTML}{273B81}
\definecolor{GJLightBlue}{HTML}{0A9DD9}
\definecolor{GJMediumGrey}{HTML}{6D6E70}
\definecolor{GJLightGrey}{HTML}{929497} 

\renewenvironment{abstract}{%
   \setlength{\parindent}{0pt}\raggedright
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
   \textcolor{GJBlue}{\large\bfseries\abstractname\space}
}{%   
   \vskip8pt
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
}

\usepackage[absolute,overlay]{textpos}

\makeatother 
      \usepackage{lineno}
      \linenumbers
      
\begin{document}

             \author[1]{Martins Kolawole  Alabi}

\renewcommand\Authands{ and }

\date{\small \em Received: 8 December 2013 Accepted: 1 January 2014 Published: 15 January 2014}

\maketitle


\begin{abstract}
        


This paper is about the proof of P ? NP based on the limiting factor that hinders the proof of P = NP when we consider randomness in the subset sum problem algorithm presented in this paper. Randomness in this paper is referred to an act of inputting integers to the program without pattern. The paper is not about to show case the extent in which the subset problem could be solved but to prove that P = NP does not exist in polynomial time. Literally, polynomial time means that as the complexity of the problem grows, the difficulty in solving it doesn?t grow too fast. The proof of x ± y = b at system 1 is the premise that was used in this paper to prove that P ? NP. The proof of x ± y = b systems are forms of x ± y = b that was derived from the coexistence of three quantities denoted by n, n + 1, n + 2 where n represents any positive integer. See the proof of x ± y = b at references for details. The proof of x ± y = b at system 1 is the proof of a mathematical method that proves something can evolve from nothing and its graph shows that the shape of the universe is a cone and this can further be mapped with an expanding universe or universes to locate the point of the big bang (a hypothetical point in space where the universe began). See No.4, at references for details.

\end{abstract}


\keywords{input, systems, subset sum problem, algorithm, p ? np, the proof of x ± y = b.}

\begin{textblock*}{18cm}(1cm,1cm) % {block width} (coords) 
\textcolor{GJBlue}{\LARGE Global Journals \LaTeX\ JournalKaleidoscope\texttrademark}
\end{textblock*}

\begin{textblock*}{18cm}(1.4cm,1.5cm) % {block width} (coords) 
\textcolor{GJBlue}{\footnotesize \\ Artificial Intelligence formulated this projection for compatibility purposes from the original article published at Global Journals. However, this technology is currently in beta. \emph{Therefore, kindly ignore odd layouts, missed formulae, text, tables, or figures.}}
\end{textblock*}


\let\tabcellsep& 	 	 		 
\section[{I.}]{I.}\par
Subset Sum Problem onsider the subset sum problem, an example of a problem that is easy to verify, but whose answer may be difficult to compute. Given a set of integers, does some nonempty subset of them sum to 0? For instance, does a subset of the set \{-2, -3, 15, 14, 7, -10\} add up to 0? The answer "yes, because \{-2, -3, -10, 15\} adds up to zero" can be quickly verified with three additions.\par
There is no known algorithm to find a subset that sum to 0 in polynomial time. Thus it takes a very long time to find a subset that sum to 0 as the complexity of the problem grows on a deterministic Turing machine given the computer's present state and any inputs (there is only one possible action that the computer might take) and sequential (it performs actions one after the other). Literally, polynomial time means that as the complexity of the problem grows, the difficulty in solving it doesn't grow too fast. Therefore, if there is a known algorithm to find a subset that sum to 0 in polynomial time then P = NP but if there is no known algorithm to find a subset that sum to 0 in polynomial time and it can be proved then P ? NP. 
\section[{II.}]{II.} 
\section[{Premise}]{Premise}\par
Computers are deterministic and they cannot identify subset that sum to 0 or subset that do not sum Author: e-mail: alabikmartins@gmail.com to 0 without cause (a thing that makes something happen). It can be observed that there is no other information given to the computer rather than the input themselves. Therefore, for us to have a solution to the P vs NP problem the input must equate to something that is provable. Otherwise, the input is meaningless.\par
The proof of x ± y = b at system 1 is the premise that was used in this paper to prove that P ? NP where b is the total sum of input. The proof of x ± y = b at system 1 gives a solution when integers that sum to 0 combines with one or two integers that do not sum to 0 regardless of input size. 
\section[{III.}]{III.} 
\section[{Assertion}]{Assertion}\par
If P = NP. Then a determinant would be found in polynomial time.\par
Determinant (a factor that causes something) here is referring to an integer n that gives indication or hint about a subset that sum to 0 when the proof of x ± y = b at system 1 is established in the subset sum problem. They can be classified as a cause for subset that sum to the total sum of input.\par
Given that x ± y = b where b is the solution to any given number x and y for which x is number i or j.\par
So that, i + y = b. Also that, j -y = b.Let i = (nb + n) / n + 1. Let y = (b -n) / n + 1. Let j = (nb + 2b -n) / n + 1.\par
Therefore the proof of x ± y = b system is given as:(nb + n) / n + 1 + (b -n) / n + 1 = b. (nb + 2b -n) / n + 1 -(b -n) / n + 1 = b.\par
System 'n' is a system which x ± y = b belongs for every given positive integer n. For instance, when n = 1.Let i = (b + n) / 2. Let y = (b -n) / 2. Let j = (3b -n) / 2.\par
Therefore the proof of x ± y = b at system 1 is given as:(b + n) / 2 + (b -n) / 2 = b. (3b -n) / 2 -(b -n) / 2 = b. 
\section[{C}]{C}\par
Abstract-The proof of x ± y = b at system 1 is the premise that was used to prove that P ? NP where b is the total sum of input in the subset sum problem. The proof of x ± y = b systems are forms of x ± y = b that was derived from the coexistence of three quantities denoted by n, n + 1, n + 2 where n represents any positive integer. The proof of x ± y = b at system 1 is a computable function definable by an algorithm where n is the argument (input value) of the function to the corresponding output value b. System 1 can be defined as a system which the proof of x ± y = b belongs when n = 1. The proof of x ± y = b at system 1 is the proof of a mathematical method that proves something can evolve from nothing and its graph shows that the shape of the universe is a cone and this can further be mapped with an expanding universe or universes to locate the point of the big bang .i.e. a hypothetical point in space where the universe began. See the reference list for details.  
\section[{Search for Determinant}]{Search for Determinant}\par
Given a set of integers \{-2, -3, 15, 14, 7, -10\} does some nonempty subset of them sum to 0? Let i denote each integer in the set.\par
Since input \{-2, -3, 15, 14, 7, -10\} equals 21. Then b = 21.\par
The proof of x ± y = b at system 1 is implicit. When we know i and b we can know n by making use of the formula n = (2 × i) -b derived from the proof of x ± y = b at system 1. For i = -2, n = -25.\par
For i = 15, n = 9. For i = 14, n = 7. For i = 7, n = -7.\par
For i = -3, n = -31. For i = -10, n = -41. i = 14 when n = 7 and i = 7 when n = -7.\par
Since 7 + (-7) = 0. Then n = 7 is a determinant and n = -7 is a determinant.\par
First hint: If the sum of equal and opposite values for n equals 0 outputs all integers in the set except integers that reference equal and opposite values for n. Therefore the answer is subset \{-2, -3, 15,-10\} which adds up to zero.\par
Given a set of integers \{-2, -3, 15, 14, -10\} does some nonempty subset of them sum to 0? Let i denote each integer in the set.\par
Since input \{-2, -3, 15, 14, 7, -10\} equals 14.Then b = 14. By using the formula n = (2 × i) -b derived from the proof of x ± y = b at system 1. For i = -2, n = -18. For i = -3, n = -20.\par
For i = 15, n = 16. For i = 14, n = 14.\par
For i = -10, n = -34. i = 14 when n = 14. Since n = 14. Then 14 is a determinant.\par
Second hint: If n is equal to the total sum of input output all integers in the set except the integer that has equal value with the total sum of input. Therefore the answer is subset \{-2, -3, 15,-10\} which adds up to zero.\par
V. 
\section[{Complexity}]{Complexity}\par
The complexity of the problem grows as we increase the length of random input. For instance, given a set of integers \{-2, -3, 15, 14, 7, -10, 50\} does some nonempty subset of them sum to 0? Let i denote each integer in the set.\par
Since input \{-2, -3, 15, 14, 7, -10, 50\} equals 71.Then b = 71.\par
By using the formula n = (2 × i) -b derived from the proof of x ± y = b at system 1.\par
For i = -2, n = -75. For i = -3, n = -77.\par
For i = 15, n = -41. For i = 14, n = -43. For i = 7, n = -57.\par
For i = -10, n = -91. For i = 50, n = 29.\par
No answer could be found because of absence of a determinant. Therefore no hint is applicable. 
\section[{a) Comment}]{a) Comment}\par
The algorithm presented in this paper outputs subset that sum to 0 quickly if we enter integers that sum to 0 as many as possible with one or two integers that do not sum to 0 via the program below e. Is P = NP? This is the real question we are concerned with. Is the set of problems in P actually the same as the set of problems in NP? The program is a P algorithm; an answer in polynomial time is called P. Questions for which an answer can be verified in Thus it is concluded that the existence of an algorithm exists in polynomial time (P) only if the algorithm runs in polynomial time regardless of input size. ? Here's a P program that does solve the problem ? It does solve the problem because the problem does not exist in P.\par
? Therefore P ? NP.\par
polynomial time is called NP. The program terminates and those NP-complete problems do not exist in P therefore, P ? NP.\begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_0}I}\end{figure}
  			\footnote{© 2014 Global Journals Inc. (US)} 		 		\backmatter  			 
\subsection[{Conclusion}]{Conclusion}\par
Subset sum problem is NP-complete and the proof of x ± y = b at system 1 has been established in the subset sum problem and each number is equally probable. This justifies that each integer in the set of integers are in conjunction with 'b'. Therefore, the algorithm and the assertion presented in this paper can be dependent on as reliable.\par
The program outputs subset that sum to 0 quickly when integers that sum to 0 combines with one or two integers that do not sum to 0 regardless of input size. As the complexity of the problem grows the program terminates quickly without an answer.			 			  				\begin{bibitemlist}{1}
\bibitem[Martins Kolawole]{b3}\label{b3} 	 		\textit{Artificial Intelligence AI Choice Mechanism Hypothesis of a Mathematical Method that Describes Quantum Numbers, Quantum Entanglement And Expanding Universe or Universes Proving That Something can evolve from Nothing (.i.e. numbers evolving from non-existent illusion) Advances in Physics Theories and Applications},  		 			Alabi Martins Kolawole 		.  		 \url{IISTE.www.iiste.org/Journals/index.-php/APTA/article/view/2155/2165}  		 	 
\bibitem[Martins Kolawole Alabi et al.]{b2}\label{b2} 	 		\textit{Mathematical Theory and Modeling},  		 			Martins Kolawole Alabi 		,  		 			The 		,  		 			Of X ± Y = B 		.  		 \url{IISTE.www.-iiste.org/Journals/index.php/MTM/article/view/10520/13697}  		 	 
\bibitem[P versus NP problem-Wikipedia]{b0}\label{b0} 	 		\textit{P versus NP problem-Wikipedia},  				 	 
\bibitem[Subset sum problem-Wikipedia]{b1}\label{b1} 	 		\textit{Subset sum problem-Wikipedia},  		 	 
\end{bibitemlist}
 			 		 	 
\end{document}