Removing Ramsey theory: Lower bounds with smaller domain size
نویسندگان
چکیده
منابع مشابه
Removing Ramsey Theory: Lower Bounds With Smaller Domain Size
Boppana B89] proves a lower bound separating the PRIORITY and the COMMON PRAM models that is optimal to within a constant factor. However, an essential ingredient in his proof is a problem with an enormously large input domain. In this paper, I achieve the same lower bound with the improvement that it applies even when the computational problem is deened on a much more reasonably sized input do...
متن کاملRamsey Theory and lower bounds for branching programs
A novel technique for obtaining lower bounds for the time versus space comp1exity of certain functions in a general input oblivious sequential model of computation is developed. This is demonstrated by studying the intrinsic complexity of the following set equality problem SE(n,m): Given a sequence x1 ,x2 ,· .• ,xn ' Yl'·· .'Yn of 2n numbers of m bits each, decide whether the sets (xl' ••• ,xnJ...
متن کاملNew lower bounds for hypergraph Ramsey numbers
The Ramsey number rk(s, n) is the minimum N such that for every red-blue coloring of the k-tuples of {1, . . . , N}, there are s integers such that every k-tuple among them is red, or n integers such that every k-tuple among them is blue. We prove the following new lower bounds for 4-uniform hypergraph Ramsey numbers: r4(5, n) > 2 n log n and r4(6, n) > 2 2 1/5 , where c is an absolute positive...
متن کاملConstructive Lower Bounds on Classical Multicolor Ramsey Numbers
This paper studies lower bounds for classical multicolor Ramsey numbers, first by giving a short overview of past results, and then by presenting several general constructions establishing new lower bounds for many diagonal and off-diagonal multicolor Ramsey numbers. In particular, we improve several lower bounds for Rk(4) and Rk(5) for some small k, including 415 ≤ R3(5), 634 ≤ R4(4), 2721 ≤ R...
متن کاملLuus-Jaakola Optimization Procedure for Ramsey Number Lower Bounds
Ramsey numbers have been widely studied for decades, but the exact values for all but a handful are still unknown. In recent years, optimization algorithms have proven useful in calculating lower bounds for certain Ramsey numbers. In this paper, we define an optimization algorithm based on the Luus-Jaakola procedure to calculate Ramsey number lower bounds. We demonstrate the effectiveness of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1997
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)00020-5