Sciweavers

1132 search results - page 46 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
COCO
2001
Springer
154views Algorithms» more  COCO 2001»
15 years 4 months ago
Quantum Algorithms for Element Distinctness
We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard...
Harry Buhrman, Christoph Dürr, Mark Heiligman...
DAM
2006
47views more  DAM 2006»
14 years 12 months ago
Trees of extremal connectivity index
The connectivity index w(G) of a graph G is the sum of the weights (d(u)d(v)) of all edges uv of G, where is a real number ( = 0), and d(u) denotes the degree of the vertex u. Le...
Huiqing Liu, Mei Lu, Feng Tian
COR
2007
90views more  COR 2007»
14 years 11 months ago
Analysis of bounds for a capacitated single-item lot-sizing problem
Lot-sizing problems are cornerstone optimization problems for production planning with time varying demand. We analyze the quality of bounds, both lower and upper, provided by a r...
Jill R. Hardin, George L. Nemhauser, Martin W. P. ...
SIAMDM
2008
140views more  SIAMDM 2008»
14 years 11 months ago
Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice
We establish new lower and upper bounds for the real number graph labelling problem. As an application, we completely determine the optimum spans of L(p, q)-labellings of the infin...
Daniel Král, Petr Skoda
TIT
2008
84views more  TIT 2008»
14 years 11 months ago
Capacity Bounds for Sticky Channels
The capacity of sticky channels, a subclass of insertion channels where each symbol may be duplicated multiple times, is considered. The primary result is to provide nearly tight n...
Michael Mitzenmacher