From: Martin Mares <mj@ucw.cz>
Date: Tue, 3 Jun 2008 09:56:39 +0000 (+0200)
Subject: \alpha -> \timesalpha
X-Git-Tag: phd-final~20
X-Git-Url: http://mj.ucw.cz/gitweb/?a=commitdiff_plain;h=2ecce8b12b8858baf7a2df58067f1ee5b4bd40b9;p=saga.git

\alpha -> \timesalpha
---

diff --git a/opt.tex b/opt.tex
index c03ca52..067ac93 100644
--- a/opt.tex
+++ b/opt.tex
@@ -1147,7 +1147,7 @@ bounds the number of comparisons. Using any of these results, we can prove an~Ac
 upper bound on the optimal algorithm:
 
 \thmn{Upper bound on complexity of the Optimal algorithm}\id{optthm}%
-The time complexity of the Optimal MST algorithm is $\O(m\alpha(m,n))$.
+The time complexity of the Optimal MST algorithm is $\O(m\timesalpha(m,n))$.
 
 \proof
 We bound $D(m,n)$ by the number of comparisons performed by the algorithm of Chazelle \cite{chazelle:ackermann}