diff --git a/theory/paper_pasc/pasc_paper.tex b/theory/paper_pasc/pasc_paper.tex
index 1c880f9abadef7fa671688aa104a36ee8eef76bf..3d68340c462c3257959c133099498b522a750d38 100644
--- a/theory/paper_pasc/pasc_paper.tex
+++ b/theory/paper_pasc/pasc_paper.tex
@@ -375,8 +375,8 @@ partition of the cell graph such that:
 \end{itemize}
 \noindent where the first criteria provides good {\em load-balancing},
 i.e.~each partition/rank should involve the same amount of work, and
-the second criteria reduces the amount of duplicated work between
-partitions/ranks.
+the second criteria reduces the {\em partition cost}, i.e.~the amount
+of duplicated work between partitions/ranks.
 
 Computing such a partition is a standard graph problem and several
 software libraries which provide good solutions\footnote{Computing