From b771d485402bbb14e9b4d9b3711b306197eebd7d Mon Sep 17 00:00:00 2001 From: Martin Mares Date: Sat, 3 May 2008 20:33:15 +0200 Subject: [PATCH] Corrections: Epilogue. --- epilog.tex | 4 +++- 1 file changed, 3 insertions(+), 1 deletion(-) diff --git a/epilog.tex b/epilog.tex index 45111d7..cbdc03a 100644 --- a/epilog.tex +++ b/epilog.tex @@ -40,7 +40,9 @@ which we have used, seem to be applicable to other ranking problems. On the othe hand, ranking of general restricted permutations has turned out to balance on the verge of $\#P$-completeness (Theorem \ref{pcomplete}). All our algorithms run on the RAM model, which seems to be the only sensible choice for problems of -inherently arithmetic nature. +inherently arithmetic nature. While the unit-cost assumption on arithmetic operations +is not universally accepted, our results imply that the complexity of our algorithm +is dominated by the necessary arithmetics. Aside from the concrete problems we have solved, we have also built several algorithmic techniques of general interest: the unification procedures using pointer-based -- 2.39.2