| 
					
				 | 
			
			
				@@ -170,7 +170,7 @@ and storing dependencies into a \emph{history matrix} $\mathcal{H}$. 
			 | 
		
	
		
			
				 | 
				 | 
			
			
				 \end{algorithm} 
			 | 
		
	
		
			
				 | 
				 | 
			
			
				  
			 | 
		
	
		
			
				 | 
				 | 
			
			
				  
			 | 
		
	
		
			
				 | 
				 | 
			
			
				-\section{Gluing the shit toghether} 
			 | 
		
	
		
			
				 | 
				 | 
			
			
				+\section{Implementation} 
			 | 
		
	
		
			
				 | 
				 | 
			
			
				  
			 | 
		
	
		
			
				 | 
				 | 
			
			
				 Before gluing all toghether, we need one last building brick necessary for 
			 | 
		
	
		
			
				 | 
				 | 
			
			
				 Dixon's factorization algorithm: a \texttt{smooth}($x$) function. In our 
			 |