Spelling checker strikes again.

[saga.git] / opt.tex

diff --git a/opt.tex b/opt.tex
index bfcfdcffac394eb811ec464d035908b8c62b2b82..86402c617a708fe47db3e157138d6623f74e16af 100644 (file)
--- a/opt.tex
+++ b/opt.tex
@@ -804,7 +804,7 @@ computation results in the real MSF of~$G$ with the particular weights.
 The \df{time complexity} of a~decision tree is defined as its depth. It therefore
 bounds the number of comparisons spent on every path. (It need not be equal since
 some paths need not correspond to an~actual computation --- the sequence of outcomes
-on the path could be unsatifisfiable.)
+on the path could be unsatisfiable.)
 
 A~decision tree is called \df{optimal} if it is correct and its depth is minimum possible
 among the correct decision trees for the given graph.