From d81ea97c01304ca3555ea6e5a08a10fb77f280bf Mon Sep 17 00:00:00 2001 From: Robin Clark Date: Mon, 17 Jan 2011 11:23:05 +0000 Subject: [PATCH] Exponenial to polynomial complexity --- eulerg/eulerg.tex | 2 ++ 1 file changed, 2 insertions(+) diff --git a/eulerg/eulerg.tex b/eulerg/eulerg.tex index 8425ac5..31d95df 100644 --- a/eulerg/eulerg.tex +++ b/eulerg/eulerg.tex @@ -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|}$ 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}