ODIn/paper-BagRelationalPDBsAreHard
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

Auto merge failed

Browse source 
Merge branch 'master' of https://gitlab.odin.cse.buffalo.edu/ahuber/SketchingWorlds
This commit is contained in:
Aaron Huber 2021-09-16 15:42:36 -04:00
parent 18674e00e5 14a560d09c
commit 8d8e369962
1 changed files with 1 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
intro-rewrite-070921.tex
View file

@ -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}.
\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
Lower bound on $\timeOf{}^*(\query,\pdb)$ & Num. $\pd$s & Hardness Assumption\\
\hline