X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/hdrcouchot.git/blobdiff_plain/46fc71ad146f83c82660e358a1a1bc2ccc0f00e6..7b5d0e870659f449509ca62822b38dc4ebf8ef3e:/14Secrypt.tex?ds=sidebyside

diff --git a/14Secrypt.tex b/14Secrypt.tex
index e160bc3..a60e4ff 100644
--- a/14Secrypt.tex
+++ b/14Secrypt.tex
@@ -13,13 +13,13 @@ graphe d'itÃ©rations, ce qui revient Ã  supprimer en chaque n{\oe}ud de ce graph
 arÃªte sortante et une arÃªte entrante.
 
 
-This aim of this section is to show 
-that finding DSSC matrices from a hypercube
-is a typical finite domain satisfaction 
-problem, classically denoted as 
-Constraint Logic Programming on Finite Domains (CLPFD). 
-This part is addressed in the first section. Next, we analyse the first
-results to provide a generation of DSSC matrices with small mixing times. 
+% This aim of this section is to show 
+% that finding DSSC matrices from a hypercube
+% is a typical finite domain satisfaction 
+% problem, classically denoted as 
+% Constraint Logic Programming on Finite Domains (CLPFD). 
+% This part is addressed in the first section. Next, we analyse the first
+% results to provide a generation of DSSC matrices with small mixing times. 
 
 \section{Programmation logique par contraintes sur des domaines finis}
 Tout d'abord, soit ${\mathsf{N}}$ le nombre d'Ã©lÃ©ments. 
