General upper and lower bounds
Lower bounds and upper bounds for MaxSAT ⋆
... in general inefficient for industrial ...refining upper bounds on the optimum solution ...refining lower bounds ...an upper bound and a lower bound ...initial lower ...
6
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
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 ...
12
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
Some upper and lower bounds on PSD-rank
... Proof: We will design a one-way quantum protocol to compute IP n in expectation and then invoke the equivalence between rank psd and communication complexity mentioned in Section 2.2. We will actu- ally prove the bound ...
21
Upper and Lower Bounds on Black-Box Steganography
... . Proof. Proposition 1 deals with the case l = 1. It remains to extend this line of analysis to the general case l > 1. As in the proof of Proposition 1, let E i denote the event that SE 2 outputs “Fail” while ...
27
Upper and lower bounds on norms of functions of matrices
... in general, due to the behavior of minimal-norm interpolating functions, it may be very difficult or impossible to find such a set S for which the ratio M/m is of moderate ...
Upper and Lower Bounds for Continuous Non-Malleable Codes
... 67. Sahai, A.: Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. In: 40th FOCS, IEEE Computer Society Press (October 1999) 543–553 68. Seurin, Y.: On the exact security of Schnorr-type ...
31
Quantum SDP-Solvers: Better upper and lower bounds
... most general result, Corollary 42, only requires that the function f can be nicely approximated locally around each possible eigenvalue of H, improving on Theorem ...
69
On Lower and Upper Bounds in Smooth and Strongly Convex Optimization
... this lower bound to the first O(d) iterations is not a mere artifact of the ...non-trivial lower bound once the number of queries exceeds the dimension ...more general classes of convex ...
51
Quantum SDP-solvers: Better upper and lower bounds
... a lower bound z ≤ Tr e −H , then we have an upper bound on the expected runtime, therefore we can turn the procedure into a unitary circuit using standard ...our general results the proof is ...
74
Lower and upper bounds of number of zeros of random algebraic polynomials
... Therefore number of roots and the measure of the exceptional set in the set [ , ] are twice the corresponding value can be considered and now show that this upper bound is same as in [0, 1]. There are many ...
10
A unified approach to universal prediction: generalized upper and lower bounds
... Abstract— We study sequential prediction of real-valued, arbitrary, and unknown sequences under the squared error loss as well as the best parametric predictor out of a large, continuous class of predictors. Inspired by ...
6
Lower and Upper Bounds in Zone Based Abstractions of Timed Automata
... In general, the normal form can be computed using the O(n 3 )-time Floyd-Warshall all-pairs-shortest-path algorithm, but when applying a guard or invariant, resetting clocks, or computing the de- lay successors, ...
14
Lower and upper competitive bounds for online directed graph exploration
... known lower bound for general graphs was improved from 2 − [54] to 5/2 − ...a lower bound on the cost of Ω(n 2 ) for unit weights, since a blind searcher might visit nearly all ...
27
General Upper Bounds on the Runtime of Parallel Evolutionary Algorithms
... concrete bounds on the parallel running time for common mi- gration topologies, we need to understand how the number of informed islands grows on each fitness level, ...a lower bound where an upper ...
35
Multilevel Monte-Carlo methods and lower-upper bounds in Initial Margin computations
... n ≥ 1, and again that a certain number of their partial derivatives with respect to the first variable exist and are continuous 2 . As a comparison with our setting, our Assumption 2.3 do not require existence of ...
35
New upper and lower bounds, the iteration algorithm for the solution of the discrete algebraic Riccati equation
... Q = Q, which implies that P ≥ P ≥ Q. Remark . P and η are two different upper bounds. It is difficult to compare them for the same measure. Further, in Section , we offer a numerical example which ...
17
On Lower and Upper Bounds of Matrices
... on lower bounds for non-negative matrices acting on non-increasing non-negative sequences in l p when p ≥ 1 and its dual version, the upper bounds when 0 < p ≤ ...such bounds explicitly ...
18
Upper and lower bounds for sums of random variables.
... But in some cases, and the lognormal discount process of section 5 is a good example, a random variable Z can be found with the property that by conditioning on it we can ac[r] ...
31