Unify typesetting of #P-completeness.

diff --git a/epilog.tex b/epilog.tex
index 2bfe779846f080c9959e1862d5c34ee7dcc11817..d4dfd1887e38337e6d4a2dd547ff9ec841dffcea 100644 (file)
--- a/epilog.tex
+++ b/epilog.tex
@@ -37,7 +37,7 @@ For the ranking problems, the situation is completely different. We have shown
 linear-time algorithms for three important problems of this kind. The techniques,
 which we have used, seem to be applicable to other ranking problems. On the other
 hand, ranking of general restricted permutations has turned out to balance on the
-verge of $\#P$-completeness. All our algorithms run
+verge of $\#{\rm P}$-completeness. All our algorithms run
 on the RAM model, which seems to be the only sensible choice for problems of
 inherently arithmetic nature. While the unit-cost assumption on arithmetic operations
 is not universally accepted, our results imply that the complexity of our algorithm