+\def\n#1#2{\>\hangindent=6em\hangafter=1 \hbox to 6em{#1 \dotfill~}#2}
+\def\[#1]{~{\it(\ref{#1})}}
+
+\n{$A(x,y)$}{Ackermann's function \[ackerdef]}
+\n{$A(x)$}{diagonal Ackermann's function \[ackerdef]}
+\n{$\band$}{bitwise conjunction: $(x\band y)[i]=1$ iff $x[i]=1 \land y[i]=1$}
+\n{$C_k$}{cycle on~$k$ vertices}
+\n{${\cal D}(G)$}{optimal MSF decision tree for a~graph~$G$ \[decdef]}
+\n{$D(G)$}{depth of ${\cal D}(G)$ \[decdef]}
+\n{$D(m,n)$}{decision tree complexity of MSF \[decdef]}
+\n{$D_n$}{$n\times n$ matrix with 0's on the main diagonal and 1's elsewhere \[hatrank]}
+\n{$\deg_G(v)$}{degree of vertex~$v$ in graph~$G$; we omit $G$ if it is clear from context}
+\n{$E(G)$}{set of edges of a graph~$G$}
+\n{$E$}{$E(G)$ when the graph~$G$ is clear from context}
+\n{${\E}X$}{expected value of a~random variable~$X$}
+\n{$K_k$}{complete graph on~$k$ vertices}
+\n{$L(\pi,A)$}{lexicographic ranking function for permutations on a~set~$A\subseteq{\bb N}$ \[brackets]}
+\n{$L^{-1}(i,A)$}{lexicographic unranking function, the inverse of~$L$ \[brackets]}
+\n{$\log n$}{a binary logarithm of the number~$n$}
+\n{$\log^* n$}{iterated logarithm: $\log^*n := \min\{i \mid \log^{(i)}n \le 1\}$; the inverse of~$2\tower n$}
+\n{$\<LSB>(x)$}{position of the lowest bit set in~$x$ \[lsbmsb]}
+\n{$\<MSB>(x)$}{position of the highest bit set in~$x$ \[lsbmsb]}
+\n{MSF}{minimum spanning forest \[mstdef]}
+\n{$\msf(G)$}{the unique minimum spanning forest of a graph~$G$ \[mstnota]}
+\n{MST}{minimum spanning tree \[mstdef]}
+\n{$\mst(G)$}{the unique minimum spanning tree of a graph~$G$ \[mstnota]}
+\n{$m(G)$}{number of edges of a graph~$G$, that is $\vert E(G)\vert$}
+\n{$m$}{$m(G)$ when the graph~$G$ is clear from context}
+\n{$\bb N$}{set of all natural numbers, including 0}
+\n{${\bb N}^+$}{set of all positive integers}
+\n{$N_0(M)$}{number of permutations satisfying the restrictions~$M$ \[restnota]}
+\n{$n(G)$}{number of vertices of a graph~$G$, that is $\vert V(G)\vert$}
+\n{$n$}{$n(G)$ when the graph~$G$ is clear from context}
+\n{$\bnot$}{bitwise negation: $(\bnot x)[i]=1-x[i]$}
+\n{$\O(g)$}{asymptotic~$O$: $f=\O(g)$ iff $\exists c>0: f(n)\le g(n)$ for all~$n\ge n_0$}
+\n{$\widetilde\O(g)$}{$f=\widetilde\O(g)$ iff $f=\O(g\cdot\log^{\O(1)} g)$}
+\n{$\bor$}{bitwise disjunction: $(x\bor y)[i]=1$ iff $x[i]=1 \lor y[i]=1$}
+\n{${\cal P}_A$}{set of all permutations on a~set~$A$ \[restnota]}
+\n{${\cal P}_{A,M}$}{set of all permutations on~$A$ satisfying the restrictions~$M$ \[restnota]}
+\n{$\per M$}{permanent of a~square matrix~$M$}
+\n{$\poly(n)$}{$f=\poly(n)$ iff $f=\O(n^c)$ for some $c$}
+\n{${\rm Pr}[\varphi]$}{probability that a predicate~$\varphi$ is true}
+\n{$\bb R$}{set of all real numbers}
+\n{$R_{C,\prec}(x)$}{rank of~$x$ in a~set~$C$ ordered by~$\prec$ \[rankdef]}
+\n{$R^{-1}_{C,\prec}(i)$}{unrank of~$i$: the $i$-th smallest element of a~set~$C$ ordered by~$\prec$ \[rankdef]}
+\n{$V(G)$}{set of vertices of a graph~$G$}
+\n{$V$}{$V(G)$ when the graph~$G$ is clear from context}
+\n{$W$}{word size of the RAM \[wordsize]}
+\n{$w(e)$}{weight of an edge $e$}
+\n{$\bxor$}{bitwise non-equivalence: $(x\bxor y)[i]=1$ iff $x[i]\ne y[i]$}
+
+\n{$\alpha(n)$}{diagonal inverse of the Ackermann's function \[ackerinv]}
+\n{$\alpha(m,n)$}{$\alpha(m,n) := \min\{ x\ge 1 \mid A(x,4\lceil m/n\rceil) > \log n \}$ \[ackerinv]}
+\n{$\beta(m,n)$}{$\beta(m,n) := \min\{i \mid \log^{(i)}n \le m/n \}$ \[itjarthm]}
+\n{$\delta_G(U)$}{all edges connecting $U\subset V(G)$ with $V(G)\setminus U$; we usually omit the~$G$}
+\n{$\delta_G(v)$}{edges of a one-vertex cut, i.e., $\delta_G(\{v\})$}
+\n{$\Theta(g)$}{asymptotic~$\Theta$: $f=\Theta(g)$ iff $f=\O(g)$ and $f=\Omega(g)$}
+\n{$\lambda_i(n)$}{inverse of the $i$-th row of the Ackermann's function \[ackerinv]}
+\n{$\varrho({\cal C})$}{edge density of a graph class~$\cal C$ \[density]}
+\n{$\Omega(g)$}{asymptotic~$\Omega$: $f=\Omega(g)$ iff $\exists c>0: f(n)\ge g(n)$ for all~$n\ge n_0$}
+