summaryrefslogtreecommitdiff
path: root/README
diff options
context:
space:
mode:
authorjan.reininghaus <jan.reininghaus@8e3bb3c2-eed4-f18f-5264-0b6c94e6926d>2013-05-07 15:14:02 +0000
committerjan.reininghaus <jan.reininghaus@8e3bb3c2-eed4-f18f-5264-0b6c94e6926d>2013-05-07 15:14:02 +0000
commite9b200b0e1982802d93c7253165b91768701c3c8 (patch)
treed161ff363664b4a67ee54a77bb63173da2ee3e3d /README
parentff3b199a8283b20c4b360df3ef36f74a01a1ac0e (diff)
updated README
git-svn-id: https://phat.googlecode.com/svn/trunk@69 8e3bb3c2-eed4-f18f-5264-0b6c94e6926d
Diffstat (limited to 'README')
-rw-r--r--README4
1 files changed, 2 insertions, 2 deletions
diff --git a/README b/README
index 8a0ca31..a87abff 100644
--- a/README
+++ b/README
@@ -18,8 +18,8 @@ contains code for several algorithmic variants:
* The "standard" algorithm (see `[1]`, p.153)
* The "row" algorithm from `[2]` (called pHrow in there)
- * The "twist" algorithm, as described in `[3]`
- * The "chunk" algorithm presented in `[4]` (default algorithm)
+ * The "twist" algorithm, as described in `[3]` (default algorithm)
+ * The "chunk" algorithm presented in `[4]`
The last two algorithms exploit the special structure of the boundary matrix
to take shortcuts in the computation. The chunk algorithm makes use of multiple