From 42d961c120bee622625bb2bfb4bd7d681b60cbd1 Mon Sep 17 00:00:00 2001 From: "Nick T." <30553301+nTh0rn@users.noreply.github.com> Date: Mon, 7 Oct 2024 11:37:37 -0400 Subject: [PATCH] Update fls_test.md --- content/articles/fls_test.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/content/articles/fls_test.md b/content/articles/fls_test.md index dbadde7..296aa85 100644 --- a/content/articles/fls_test.md +++ b/content/articles/fls_test.md @@ -193,4 +193,4 @@ $$ \textrm{Lines} = \frac{n+1}{(2^{n+1})n} \times \textrm{bitstream length} \ \ # Conclusion -Thank you for reading! Another possible use of the FLS Test is diagonal-line counting, as originally conceptualized by my fellow contributor, [Fernando Guadarrama](https://inspirehep.net/authors/2577036). Check out my article on a [diagonally wrapping traversal algorithm](/articles/diagonal_traversal) for a possible diagonal FLS Test implementation. Also be sure to check out the original paper I wrote this for [here](https://arxiv.org/abs/2404.09395). \ No newline at end of file +     Thank you for reading! Another possible use of the FLS Test is diagonal-line counting, as originally conceptualized by my fellow contributor, [Fernando Guadarrama](https://inspirehep.net/authors/2577036). Check out my article on a [diagonally wrapping traversal algorithm](/articles/diagonal_traversal) for a possible diagonal FLS Test implementation. Also be sure to check out the original paper I wrote this for [here](https://arxiv.org/abs/2404.09395). \ No newline at end of file