Sciweavers

1132 search results - page 5 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
COMBINATORICS
2004
103views more  COMBINATORICS 2004»
13 years 6 months ago
Constructive Lower Bounds on Classical Multicolor Ramsey Numbers
Xu Xiaodong, Xie Zheng, Geoffrey Exoo, Stanislaw P...
COLT
2005
Springer
14 years 7 days ago
Localized Upper and Lower Bounds for Some Estimation Problems
Abstract. We derive upper and lower bounds for some statistical estimation problems. The upper bounds are established for the Gibbs algorithm. The lower bounds, applicable for all ...
Tong Zhang
DCC
2007
IEEE
14 years 6 months ago
Bounds on Redundancy in Constrained Delay Arithmetic Coding
We address the problem of a finite delay constraint in an arithmetic coding system. Due to the nature of the arithmetic coding process, source sequences causing arbitrarily large ...
Ofer Shayevitz, Eado Meron, Meir Feder, Ram Zamir
STACS
1999
Springer
13 years 11 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
DAM
2007
70views more  DAM 2007»
13 years 6 months ago
Path-kipas Ramsey numbers
For two given graphs F and H, the Ramsey number R(F, H) is the smallest positive integer p such that for every graph G on p vertices the following holds: either G contains F as a ...
A. N. M. Salman, H. J. Broersma