handouts/ho04.tex
changeset 671 83e38043ed78
parent 669 2f5a4d76756d
child 716 df7d47a507f8
equal deleted inserted replaced
670:551d018cbbac 671:83e38043ed78
     1 % !TEX program = xelatex
     1 % !TEX program = xelatex
     2 \documentclass{article}
     2 \documentclass{article}
     3 \usepackage{../style}
     3 \usepackage{../style}
     4 \usepackage{../langs}
     4 \usepackage{../langs}
     5 \usepackage{../graphics}
     5 \usepackage{../graphics}
     6 
     6 \usepackage{skull}
     7 
     7 
     8 \begin{document}
     8 \begin{document}
     9 \fnote{\copyright{} Christian Urban, King's College London, 2014, 2015, 2016, 2017, 2019}
     9 \fnote{\copyright{} Christian Urban, King's College London, 2014, 2015, 2016, 2017, 2019}
    10 
    10 
    11 \section*{Handout 4 (Sulzmann \& Lu Algorithm)}
    11 \section*{Handout 4 (Sulzmann \& Lu Algorithm)}
   428 In place where we chopped off the $c$, we now need to do the $\inj$ of $c$.
   428 In place where we chopped off the $c$, we now need to do the $\inj$ of $c$.
   429 Therefore $\inj\,r\,c\,v$ in the definition above. That is the same with
   429 Therefore $\inj\,r\,c\,v$ in the definition above. That is the same with
   430 the other clauses in $\inj$. 
   430 the other clauses in $\inj$. 
   431 
   431 
   432 
   432 
   433 Phew\ldotsSweat\ldots Unfortunately, there is one more problem with the
   433 Phew\ldots{}Sweat\ldots!\#@$\skull$\%\ldots Unfortunately, there is
   434 described algorithm so far: it is very slow. We need to include in all
   434 a gigantic problem with the described algorithm so far: it is very
   435 this the simplification from Lecture 2. This is what we shall do next.
   435 slow. We need to include in all this the simplification from Lecture
       
   436 2. And what rotten luck: simplification messes things up and we need
       
   437 to rectify the mess. This is what we shall do next.
   436 
   438 
   437 
   439 
   438 \subsubsection*{Simplification}
   440 \subsubsection*{Simplification}
   439 
   441 
   440 Generally the matching algorithms based on derivatives do
   442 Generally the matching algorithms based on derivatives do