X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/hdrcouchot.git/blobdiff_plain/b00f4bba43bbc502f81d237292f4757d9fd548cc..21064a689bad8fe8e8666af593cad468f1a89483:/annexePreuvesComplexiteStego.tex?ds=sidebyside

diff --git a/annexePreuvesComplexiteStego.tex b/annexePreuvesComplexiteStego.tex
index b8f9704..11af488 100644
--- a/annexePreuvesComplexiteStego.tex
+++ b/annexePreuvesComplexiteStego.tex
@@ -1,7 +1,6 @@
-\begin{theorem}\label{th:cplxt:hugo}
-Le schéma HUGO a une complexité de l'ordre de 
-$\theta(2 \times n^2(343^2 + \ln(n)))$
-\end{theorem}
+Démontrons le théorème suivant:
+
+\theocplstegano*
 
 
 First of all, HUGO starts with computing the second order SPAM Features.