From bf3201fca03d66baf065656d818e697dc8afe470 Mon Sep 17 00:00:00 2001 From: Martin Mares Date: Sat, 19 Apr 2008 15:26:14 +0200 Subject: [PATCH] Inverses: many of them. --- PLAN | 3 +-- notation.tex | 2 +- 2 files changed, 2 insertions(+), 3 deletions(-) diff --git a/PLAN b/PLAN index 953ff49..3967d5d 100644 --- 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 24a4624..bebbe72 100644 --- 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 -- 2.39.2