Auto merge failed
Merge branch 'master' of https://gitlab.odin.cse.buffalo.edu/ahuber/SketchingWorlds
This commit is contained in:
commit
8d8e369962
|
@ -146,7 +146,7 @@ We stress that this question is very well motivated, even for one of the simples
|
||||||
|
|
||||||
\mypar{Our lower bound results} Unfortunately, we prove the negative. In fact in Table~\ref{tab:lbs}\AR{Cref was not formatting Table correct so added Table in explicitly.} we show that depending on what hardness result/conjecture we assume, we get various emphatic versions of {\em no} as an answer to \Cref{prob:informal}.
|
\mypar{Our lower bound results} Unfortunately, we prove the negative. In fact in Table~\ref{tab:lbs}\AR{Cref was not formatting Table correct so added Table in explicitly.} we show that depending on what hardness result/conjecture we assume, we get various emphatic versions of {\em no} as an answer to \Cref{prob:informal}.
|
||||||
\begin{table}
|
\begin{table}
|
||||||
\begin{tabular}{|p{0.4\textwidth}|p{0.15\textwidth}|p{0.35\textwidth}|}
|
\begin{tabular}{|p{0.43\textwidth}|p{0.12\textwidth}|p{0.35\textwidth}|}
|
||||||
\hline
|
\hline
|
||||||
Lower bound on $\timeOf{}^*(\query,\pdb)$ & Num. $\pd$s & Hardness Assumption\\
|
Lower bound on $\timeOf{}^*(\query,\pdb)$ & Num. $\pd$s & Hardness Assumption\\
|
||||||
\hline
|
\hline
|
||||||
|
|
Loading…
Reference in a new issue