Inverses: many of them.

diff --git a/PLAN b/PLAN
index 953ff493bb94c563a1694e93e3a1d825a5b6517e..3967d5d37fe54de82646ae5b3b50abdd29d48087 100644 (file)
--- a/PLAN
+++ b/PLAN
@@ -67,7 +67,6 @@ Related:
 - practical considerations: katriel:cycle, moret:practice (mention pairing heaps)
 - parallel algorithms: p243-cole (see also remarks in Karger and pettie:minirand), pettie:parallel
 - K best trees
-- random sampling (propp:randommst)
 - degree-restricted cases and arborescences
 - bounded expansion classes?
 - mention matroids
@@ -90,7 +89,7 @@ Ranking:
 - JN: explain approx scheme
 - JN: 4.5.1:  neslo by preci isolovat nejaky vlstnosti restriction matrices
   tak aby byl speedup? Staci napr predpokladat 4.5.2 (jako to postulovat)
-  co je to vlstne za matice co splnuji 4.5.2
+  co je to vlastne za matice co splnuji 4.5.2
 - JN: bounded-degree restriction graphs; would it imply general speedup?
 
 Notation:

diff --git a/notation.tex b/notation.tex
index 24a46245cde5efebf7ae2dad8a8a75c1e303cc24..bebbe7283a9f33792ad9179bb9efc28c54f855a0 100644 (file)
--- a/notation.tex
+++ b/notation.tex
@@ -146,7 +146,7 @@ where $U^*$ is the complete graph on~$U$. Similarly for $G.F$ and $G.U$.
 
 %--------------------------------------------------------------------------------
 
-\section{Ackermann's function and its inverse}\id{ackersec}%
+\section{Ackermann's function and its inverses}\id{ackersec}%
 
 The Ackermann's function is an~extremely quickly growing function which has been
 introduced by Ackermann \cite{ackermann:function} in the context of