robin/Robin_PHD
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Exponenial to polynomial complexity

Browse Source
This commit is contained in:
Robin Clark 2011-01-17 11:23:05 +00:00
parent e3a27047ea
commit d81ea97c01
1 changed files with 2 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
eulerg/eulerg.tex
View File

@ -330,5 +330,7 @@ The order of area operations is generally\footnote{In the case where the diagram
reduced by requiring several $K.|P|.2^{|P|}$ reduced by requiring several $K.|P|.2^{|P|}$
instead of $N.2^N$ as $K < N$. instead of $N.2^N$ as $K < N$.
This has effectively reduced the order of the searching algorithm from exponential to polynomial order.
\vspace{40pt} \vspace{40pt}