Lower bounds for general size items
Kernelization lower bounds for finding constant-size subgraphs.
... 1 Introduction Kernelization is the main mathematical concept for provably efficient preprocess- ing of computationally hard problems. This concept has been extensively studied (see, e.g., [ 17 , 21 , 26 , 27 ]) and it ...
11
Lower bounds and upper bounds for MaxSAT ⋆
... in general inefficient for industrial ...upper bounds on the optimum solution ...refining lower bounds ...a lower bound ...initial lower bounds and upper bounds to ...
6
Monotone Projection Lower Bounds from Extended Formulation Lower Bounds
... Ω(1) lower bound on monotone circuits computing the permanent, a lower bound that still remains ...Ω(1) lower bound on the ...of size 2 Ω(n) over R and over the tropical (min,+) ...formulation ...
15
Improved upper bounds and lower bounds on broadcast function
... the general lower bound, we introduce the first non-trivial general lower bound on B(n) by partitioning the vertices and the ...this lower bound has two limitations: only valid when n ≤ ...
104
Lower bounds and resource allocation
... of lower bound has been always present as a crucial point in claims ...In general, a lower bound is a function such that for each claims problem pE, cq and each agent i P N, b i pE, cq is the minimal ...
17
On Bayes Risk Lower Bounds
... risk lower bounds, it only applies to weighted quadratic loss functions (as its proof relies on Cauchy-Schwarz inequality) and requires the underlying Fisher information to be easily computable, which ...
58
General optimized lower and upper bounds for discrete and continuous arithmetic Asian options
... Our proposed method is distinguished from other pricing methodologies for Asian options due to a number of appealing features. First, it can be applied flexibly to a wide range of non-Gaussian models, such as pure jump ...
38
New bounds for formula size
... Copies of full items can be used for personal research or study, educational, or not-for- profit purposes without prior permission or charge. Provided that the authors, title and full bibliographic details are ...
12
Genuine Lower Bounds for QBF Expansion
... first general technique for proving genuine lower bounds in expansion-based QBF proof ...proof-size lower bound for a whole class of formula families, and demonstrate the power of our ...
15
New Lower Bounds For Orthogonal Drawings
... worst-case bounds on the area and the number of ...to lower bounds, ...previous lower bounds have appeared in [12, 14, 19, 21, ...improve, lower bounds for orthogonal ...
31
Upper and lower bounds for the Bregman divergence
... a general functional F and develop some properties of ...find lower and upper bounds for the corresponding Bregman divergence given by the smoothness, respectively, the con- vexity of the space X as ...
12
Lower Bounds for Passive and Active Learning
... of size n under a margin condition, some classes admit rates of the order 1/n while others only (log ...risk bounds for active ...prove lower bounds for passive learning based on Alexander’s ...
11
Lower Bounds in the Hardware Token Model
... Generally speaking, the bit-OT token model has many advantages over a model that allows more complex tokens. First of all, the OT functionality is simple thus facilitating hardware design and implementation. Secondly, in ...
34
Lower Bounds for Straight Line Factoring
... Note that P does not depend n. So, straight line factoring algorithms cannot adjust P to depend on n. Typically, a single straight line factoring algorithm will target a finite set of n, such that the set of all n ...
12
On Circuit Lower Bounds from Derandomization
... circuit lower bounds for EXP (see [4], for ...circuit lower bounds for ...circuit lower bounds of some ...polynomial size or the permanent over Z does not have arithmetic ...
8
Lower Bounds for Differentially Private RAMs
... combined size of T w lower ...to lower bound the values when processing the random sequence Q and not Q i ...a ...
31
Memory Lower Bounds of Reductions Revisited
... Memory lower bound of restricted ...provided general techniques helping achieve memory-tight ...ory lower bound of reductions from multi-challenge unforgeability (mUF) to stan- dard unforgeability ...
30
Locality from Circuit Lower Bounds
... — a condition that has much of a Gaifman locality flavor. In fact, to prove that closure under such swaps holds for Arb-invariant FO(Succ) formulas, we use a reduction to the upper bound for Gaifman locality from Theorem ...
50
Lower Bounds for Collusion-Secure Fingerprinting
... A General Lower Bound In this section, we extend the lower bound from the previous section to apply to any secure coding ...the general case, the coalition may not be able to categorize any of ...
8
Lower Bounds for Oblivious Subspace Embeddings
... Next we prove a slightly weaker bound for the non-uniform version of the problem. Lemma 12. Consider the problem of throwing d balls independently at m ≤ d 1+γ bins. In each throw, bin i receives the ball with ...
15