X-Git-Url: http://mj.ucw.cz/gitweb/?a=blobdiff_plain;ds=inline;f=opt.tex;h=067ac93a268cc556e548fbb371b596b71acba4d7;hb=124f193d14bed24539c5cd59407637cc38dbe740;hp=c03ca52a66399b37278126746cfaef48973fc81e;hpb=9d583c4165832bae94da5309e1bea30e6b74971c;p=saga.git

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}