• No results found

lower bounds

Lower Bounds for Non-Commutative Skew Circuits

Lower Bounds for Non-Commutative Skew Circuits

... exponential lower bounds for non-commutative arithmetic formulas (a restriction of general non-commutative arithmetic circuits) and more generally for non-commutative algebraic branching programs ...

38

Some Lower Bounds for Estrada Index

Some Lower Bounds for Estrada Index

... This graph invariant was proposed as a structure-descriptor, used in the modeling of certain features of the 3D structure of organic molecules [2], in particular of the degree of proteins and other long-chains ...

6

Lower  Bounds  on  Assumptions  behind  Indistinguishability  Obfuscation

Lower Bounds on Assumptions behind Indistinguishability Obfuscation

... prove lower bounds on the assumptions that imply iO in a black-box way, based on computational ...any lower bound for iO needs to somehow rely on computational assumptions, because if P = NP then ...

18

Exponential lower bounds and separation for query rewriting

Exponential lower bounds and separation for query rewriting

... known lower bounds and separation results from circuit complexity to prove similar results for the size of rewritings that do not use non-signature ...

13

On Circuit Lower Bounds from Derandomization

On Circuit Lower Bounds from Derandomization

... [7] J EFF K INNE , D IETER VAN M ELKEBEEK , AND R ONEN S HALTIEL : Pseudorandom generators, typically-correct derandomization, and circuit lower bounds. Technical Report TR10-129, Electron. Colloq. on ...

8

Monotone Projection Lower Bounds from Extended Formulation Lower Bounds

Monotone Projection Lower Bounds from Extended Formulation Lower Bounds

... exponential lower bound on arbitrary extended formulations of several different ...their lower bound on the cut polytope ...such lower bounds on several other polytopes; we use his ...

15

Lower  Bounds  on  Lattice  Enumeration  with  Extreme  Pruning

Lower Bounds on Lattice Enumeration with Extreme Pruning

... is lower bounded, that is, if S is sufficiently big (with respect to its volume, or its Gaussian measure for the case of solving LWE), then the function f defining S can be lower bounded: as a special case, ...

31

A Review on Lower Bounds for the Domination Number

A Review on Lower Bounds for the Domination Number

... on Lower Bounds for the Domination Number” can make an in depth study in graphs and its related ...the Lower bounds for the domination number. We also arrived out Lower bounds on ...

5

Upper and lower bounds for the Bregman divergence

Upper and lower bounds for the Bregman divergence

... and lower bounds on the Bregman divergence ξ F (y, x) := F(y) – F(x) – ξ , y – x for some convex functional F on a normed space X , with subgradient ξ ∈ ∂ F ...

12

Lower bounds for some factorable matrices

Lower bounds for some factorable matrices

... In [8], Rhoades investigated the lower bounds question for the Rhaly matrices, and obtained some partial results. In this paper, we return to the study of the Rhaly matrices, as special cases of factorable ...

13

Memory  Lower  Bounds  of  Reductions  Revisited

Memory Lower Bounds of Reductions Revisited

... to lower bound results for (one-way secure) PKE schemes, signatures, and many other primitives in the multi-user setting, in which key pairs satisfy unique-key re- ...memory lower bounds in the ...

30

Lower  Bounds  for  Differentially  Private  RAMs

Lower Bounds for Differentially Private RAMs

... The cell probe model does not effectively capture the correct scenario for data structures that provide privacy of the operations performed such as obliv- ious RAM. The typical scenario considered involves two parties ...

31

Lower bounds for the low rank matrix approximation

Lower bounds for the low rank matrix approximation

... sharp lower bounds of D – A are derived for a unitarily invariant norm ...sharp lower bounds of D – A are given for the low-rank approximation problem and some proofs of Theorem ...

14

Quantum algorithms and lower bounds for convex optimization

Quantum algorithms and lower bounds for convex optimization

... quantum lower bounds on the query complexity of convex optimization, showing in particular that Ω( √ n) quantum queries to a separation oracle are needed to implement an optimization oracle, implying an Ω( ...

44

Lower bounds of concentration in a small open economy

Lower bounds of concentration in a small open economy

... We have tested Sutton’s theory of concentration with Finnish data, using stochastic frontiers to estimate lower bounds for concentration. It seems that in a small open economy there are some features that ...

24

Robust lower bounds for communication and stream computation

Robust lower bounds for communication and stream computation

... proving lower bounds in a variety of settings, including the cell-probe and data stream models, circuit and decision tree complexity and VLSI ...imply lower bounds for various models of ...

36

Empirical Lower Bounds on the Complexity of Translational Equivalence

Empirical Lower Bounds on the Complexity of Translational Equivalence

... Figure 1 came from a real bilingual bitext, and Example 2 in Section 3.5 came from a real monolingual bitext. 7 Neither of these ex- amples can be hierarchically aligned correctly without gaps, even without constraining ...

8

Bandwidth-Hard  Functions:  Reductions   and  Lower  Bounds

Bandwidth-Hard Functions: Reductions and Lower Bounds

... parameter n = 2 20 (filling nw = 1GB of RAM in about 1 second according to Argon2 benchmarks [BDK16]) then n 2/3 · w corresponds to a cache-size of 10M B— our lower bounds would not apply if the attacker’s ...

36

Lower Bounds and Aggregation in Density Estimation

Lower Bounds and Aggregation in Density Estimation

... upper bounds for some procedure and do not deal with the problem of optimality of their ...state lower bounds for aggregation procedure in the regression ...knowledge, lower bounds for ...

11

Lower Bounds for Generalized Regulators

Lower Bounds for Generalized Regulators

... In 1999, Friedman and Skoruppa demonstrated a method to derive lower bounds for the relative regulator of an extension L/K of number fields. The relative regulator is defined using the subgroup of relative ...

86

Show all 10000 documents...

Related subjects