shorten complexity section

Graphe-Slides.tex

@@ -3954,7 +3954,7 @@ On a $c(T) \leq c(H^*)$
 \end{frame}
 
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-\begin{frame}{Languages}
+  \begin{frame}{Languages}
   \begin{block}{Language}
     A language $\mathcal{L}$ is an infinite set of strings
   \end{block}
@@ -4032,6 +4032,7 @@ On a $c(T) \leq c(H^*)$
 \end{frame}
 
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+\shrink{
 \begin{frame}{Computational models}
   In order to define computational properties, we need an abstract
   machine model on which we can measure resource use
@@ -4180,6 +4181,7 @@ On a $c(T) \leq c(H^*)$
   problems.
 
 \end{frame}
+}
 
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \begin{frame}{Algorithmic complexity}
@@ -4220,7 +4222,8 @@ On a $c(T) \leq c(H^*)$
 \end{frame}
 
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-\begin{frame}{P-Completeness}
+\shrink{
+  \begin{frame}{P-Completeness}
   \begin{block}{Class $P$}
     Languages recognized in polynomial time in the RAM model
   \end{block}
@@ -4251,7 +4254,7 @@ On a $c(T) \leq c(H^*)$
     connected?
   \end{block}
 \end{frame}
-
+}
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \begin{frame}{NP}
   \begin{block}{Informal definition}
@@ -4389,7 +4392,8 @@ On a $c(T) \leq c(H^*)$
 \end{frame}
 
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-\begin{frame}{Function Problems}
+\shrink{
+  \begin{frame}{Function Problems}
   \begin{itemize}
   \item P, NP contain only \emph{decision} problems. Functions
     belong to $FP$ or $FNP$.
@@ -4434,6 +4438,7 @@ On a $c(T) \leq c(H^*)$
 \begin{frame}{Complexity Classes}
       \includegraphics[width=\textwidth]{complexity-classes}
 \end{frame}
+}
 
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \begin{frame}{Dealing with NP-completeness}