[PDF] Top 20 Memory Lower Bounds of Reductions Revisited

... Memory lower bound of restricted ...on memory-tightness, and provided general techniques helping achieve memory-tight ...ory lower bound of reductions from multi-challenge ... See full document

... average-case reductions for EXP (as in [1]), and the Nisan-Wigderson hardness-based pseudorandom generator construction [9, ...linear-time reductions, and Kannan’s circuit lower bounds for Σ p ... See full document

... second lower bound does not rule out black-box construction of iO based on believable assumptions, but shows that achieving such constructions for a large variety of primitives is as hard has solving another long ... See full document

... Consider the following problem: a large data set x ∈ {0,1} k is stored on a storage device in encoded form, but a small fraction of the encoding may be corrupted. We want to execute an algorithm M on x, but most likely M ... See full document

... ORAM lower bound by Goldreich and Ostrovsky [16] considered offline ORAMs with “balls-and-bins” encoding and security against an all-powerful ...various memory locations referred to as ...ORAM lower ... See full document

... available lower bound is t ≥ Ω(n/r), see [12], Theorem ...the lower bound in [12] is within a polynomial of the best possible that one can obtain without solving Problem ...have lower bounds ... See full document

... query lower bound on the membership oracle by reductions from search with wildcards ...The lower bound on evaluation queries uses a similar reduction, but this only works for an evaluation oracle ... See full document

... analyses memory footprints of 563 representative benchmark sparse matrices with respect to their partitioning into uniformly-sized ...in memory are considered and statistically evaluated. Memory ... See full document

... our lower bounds will use a reduction from a communication problem in the fixed-partition model to one where the allocation σ ∼ ...these reductions, the players choose σ using public random bits, but ... See full document

... proving lower bounds in this setting a challenging task; and indeed the PAIRCOND lower bounds established in the aforementioned works are quite complex and ... See full document

... Data-Independent Memory Hard Function (iMHF) is described by the red-blue pebbling cost of the directed acyclic graph (DAG) associated with that ...unconditional lower bound on the energy cost of scrypt in ... See full document

... a lower bound on the cost of sieving (ignoring subexponential terms) and an upper bound on the cost of of enumeration (either [11, Table 4] or [10, Table ... See full document

... There are some reasons for the study of lower bound of a low-rank matrix approximation problem. Firstly, as far as we know, there is no literature to consider the lower bound of the low-rank matrix ... See full document

... exponential lower bounds for the size of ‘pure’ rewritings above may look discouraging in the OBDA ...exponential lower bounds were proved for a sequence of pairs (q n , T n ... See full document

... Our main result rules out general functional encryption under the one message secure, non-adaptive simulation definition (1-NA-SIM). In particular, this rules out both of the scenarios presented at the end of the ... See full document

... The paper is organised as follows. In section 2, we list some recent sufficient conditions issued from [22] and [45] for the existence of an error bound and we review the results given in [5–7] about the characterization ... See full document

... the bounds approach the model is estimated separately for different types of industries without including R&D or advertising as explanatory ...corresponding bounds on the basis of ...these bounds ... See full document

... [1] G.A. ANASTASSIOU, Univariate Ostrowski inequalities, revisited.. CERONE and S.S. DRAGOMIR, New bounds for the three-point rule involving the Riemann-Stieltjes integrals, in Advances [r] ... See full document

... for arithmetic circuits with a single input variable. Years after, the same idea was used by Shoup and Smolensky [31], in the context of bounded-depth linear arithmetic circuits (i. e., bounded-depth arith- metic ... See full document

... We analyze investments in gas-fired power plants based on stochastic electricity and natural gas prices. A simple but realistic two-factor model is used for price processes, enabling analysis of the value of operating ... See full document