Results 261 to 270 of about 5,110,730 (289)

Lower bounds for lower Ramsey numbers

Journal of Graph Theory, 1990
AbstractFor any graph G, let i(G) and μ;(G) denote the smallest number of vertices in a maximal independent set and maximal clique, respectively. For positive integers m and n, the lower Ramsey number s(m, n) is the largest integer p so that every graph of order p has i(G) ≤ m or μ;(G) ≤ n. In this paper we give several new lower bounds for s (m, n) as
Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak   +3 more
openaire   +1 more source

Lower Bounds for Transversal Covers

Designs, Codes and Cryptography, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brett Stevens, Lucia Moura, Eric Mendelsohn   +2 more
openaire   +2 more sources

Lower bounds for asynchronous consensus

Distributed Computing, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Lower Bounds on Crosspoints in Concentrators

IEEE Transactions on Computers, 1982
Lower bounds on the required number of crosspoints in concentrators, a class of interconnection networks, are given. The lower bounds are obtained from a straightforward necessary condition on the number of crosspoints in sparse crossbar full capacity concentrators. Because this condition must be satisfied by all full capacity concentrators embedded in
Shinji Nakamura, Gerald M. Masson
openaire   +3 more sources

On Lower Bounds For Covering Codes

Designs, Codes and Cryptography, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mahesh C. Bhandari, K. K. P. Chanduka, Arbind K. Lal   +2 more
openaire   +2 more sources

Lower Bounds for Lucas Chains

SIAM Journal on Computing, 2002
Summary: Lucas chains are a special type of addition chains satisfying an extra condition: for the representation \(a_k=a_j + a_i\) of each element \(a_k\) in the chain, the difference \(a_j - a_i\) must also be contained in the chain. In analogy to the relation between addition chains and exponentiation, Lucas chains yield computation sequences for ...
openaire   +2 more sources

A guided tour of chernoff bounds

Information Processing Letters, 1990
Torben Hagerup
exaly  

Lower Bounds

2007
openaire   +3 more sources

Reliability Bounds for Multistate Systems with Multistate Components

Operations Research, 1985
Kailash Kapur
exaly  

Tables for Obtaining Weibull Confidence Bounds and Tolerance Bounds Based on Best Linear Invariant Estimates of Parameters of the Extreme-Value Distribution

Technometrics, 1973
Nancy R Mann
exaly