aboutsummaryrefslogtreecommitdiffstats
path: root/paper/sections/intro.tex
diff options
context:
space:
mode:
Diffstat (limited to 'paper/sections/intro.tex')
-rw-r--r--paper/sections/intro.tex1
1 files changed, 0 insertions, 1 deletions
diff --git a/paper/sections/intro.tex b/paper/sections/intro.tex
index 4c18faf..c89c641 100644
--- a/paper/sections/intro.tex
+++ b/paper/sections/intro.tex
@@ -72,7 +72,6 @@ be sufficient to recover the graph~\cite{donoho2006compressed, candes2006near}.
However, the best known upper bound to this day is $\O(s^2\log
m)$~\cite{Netrapalli:2012, Daneshmand:2014}
-
The contributions of this paper are the following:
\begin{itemize}
\item we formulate the Graph Inference problem in the context of