Improved Upper Bound on the Unsatisfiability Threshold
An improved upper bound on the density of universal random graphs
... Note that the first result above deals with embeddings of n-vertex graphs into random graphs with larger vertex sets, which makes the embedding somewhat easier. On the other hand, the second result deals with tight ...
23
Completion of Computation of Improved Upper Bound on the Maximum Average Linear Hull Probabilty for Rijndael
... an upper bound that is a function of the number of core encryption rounds being ...an upper bound that is independent of the number of rounds under consideration, and many assume the use of a ...
6
On an upper bound for Sherman’s inequality
... Acknowledgements The research of the first and third author has been supported by the Croatian Science Foundation under the project 5435. The authors would like to thank the referees for their valuable comments and ...
17
Upper Bound Approximations for BlockMaxWand
... 1 http://lemurproject.org/clueweb12/ time, which are > 50%. This is confirmed by the reduction on the total number of postings processed by BMW. These results confirm the findings in [10], where the authors analysed the ...
5
Improved upper bound on root number of linearized polynomials and its application to nonlinearity estimation of Boolean functions
... per bound on the root number of any given linearized ...lower bound of the second-order nonlinearity, through an example of the monomial Boolean function g µ = T r(µx 2 2r +2 r +1 ) over any finite field F ...
28
On a numerical upper bound for the extended Goldbach conjecture
... An explicit value for how large N needs to be before the TGC holds was found by Borozdin, who showed that N > 3 3 15 is sufficient [16]. In 1997, the TGC was shown to be conditionally true for all odd N > 5 by ...
81
The importance of being the upper bound in the bivariate family.
... the upper bound is also related to the test of comparing two proportions from a Bayesian ...and improved by obtaining the Bayes factor. Once again, the upper bound appears in this ...
30
Improved Indifferentiability Security Bound for the JH Mode
... Our work leaves room for more research into the JH mode. It is somewhat remarkable that despite the absence of generic attacks with work-factor significantly lower than n bits, the proven 1st/2nd pre-image and ...
18
An improved bound on parity vertex colourings of outerplane graphs
... below. Corollary 3.1. If G is a 2-connected bipartite outerplane graph, then χ p ( G ) ≤ 8. Czap [2] showed that the upper bound 8 is sharp by constructing an outerplane graph consisting of three ...
6
Improved bound on the worst case complexity of Policy Iteration
... Solving Markov Decision Processes (MDPs) is a recurrent task in engineering. Even though it is known that solutions for minimizing the infinite horizon expected reward can be found in polynomial time using Linear ...
11
An upper bound for the minimum weight of the dual codes of desarguesian planes
... Abstract We show that a construction described in [K.L. Clark, J.D. Key, M.J. de Resmini, Dual codes of translation planes, European J. Combin. 23 (2002) 529–538] of small-weight words in the dual codes of finite ...
10
Upper bound estimate of character sums over Lehmer’s numbers
... a∈A χ (a), and gave a sharp upper bound estimate for it. WZ participated in the research and summary of the study. Acknowledgements The authors would like to thank the referees for their very helpful and ...
6
Local Search for Unsatisfiability
... 2 IST/INESC-ID, Technical University of Lisbon, Portugal [email protected] Abstract. Local search is widely applied to satisfiable SAT problems, and on some classes outperforms backtrack search. An intriguing chal- ...
14
An Estimate of an Upper Bound for the Entropy of English
... We present an estimate of an upper bound of 1.75 bits for the entropy of characters in printed English, obtained by constructing a word trigram model and then computing the cross[r] ...
10
A Probabilistic Upper Bound on Differential Entropy
... To illustrate what such a distribution looks like, one can imagine a loose string threaded between each pair of pegs placed at the gh and mzh , as in Figure 2. When the ends are pulled tight, the string traces out a ...
5
Checking Unsatisfiability Proofs in Parallel
... The seven input clauses are listed in the upper-left corner of the table, where each clause is assigned a unique identifier (ID) from 1 to 7. In the left part of the table, below the horizontal line, a trace of ...
16
Improved Authenticity Bound of EAX, and Refinements
... decryption queries, or vice versa. In this case, we may not have “fresh” randomness in order to show that the success probability of the last decryption query is small. We also provide ideas to reduce the computation ...
20
An upper bound for the norm of a GCD related matrix
... Ligh, Matrices associated with classes of arithmetical functions , Journal of Number Theory 45 (1993), no.. Haukkanen, On the p norm of GCD and related matrices , JIPAM.[r] ...
6
An upper and lower bound of the Medication Possession Ratio
... an upper and lower bound of the MPR trend is developed with an upper bound acknowledging patients who change their treatment and the lower bound acknowledging patients who discontinue ...
10
UPPER BOUND ON SURFACE MEASURE OF NODAL SETS
... similar upper bound on the complex hypersurface volume of the complex nodal ...an upper bound on the real nodal volume and indeed would the complex volume tends to zero as one shrinks the ...
37