updating todo

jaehyunp · jaehyunp · commit 61613806be60 · 2016-06-10T14:09:29.000-07:00
diff --git a/TODO.txt b/TODO.txt
@@ -1 +1,5 @@
 * Dinic implementation is not exactly Dinic, but it seems fast enough. Ideally we want to rewrite it.
+* Write a faster FFT code.
+* Add fast Hadamard transform for solving the following problem:
+    Given A[], B[], find C[] such that
+      C[i] = sum_j A[j] B[i xor j]
