Lower bound arguments with “Inaccessible” numbers
نویسندگان
چکیده
منابع مشابه
Lower Bound Arguments with "Inaccessible" Numbers
The lirst result presented in this paper is a lower bound of Q(log n) for the computation time of concurrent-write parallel random access machines (PRAMS) with operation set { +, multiplication by constants} that recognize the “threshold set” {X E Z” 1 x1 + . . . + ,Y, <xn} for inputs from (0, 1, 2, . . . . 2 o(“-i”rn)}“. The same bound holds for PRAMS with arbitrary binary operations, if the s...
متن کاملOn the Use of Inaccessible Numbers and Order Indiscernibles in Lower Bound Arguments for Random Access Machines
and DISJOINT SETS:: {(yr,. ",!n¡2,2r,"',zntz) e N" I n is even and {Y""' '!n¡z\ ^ {2""''z'¡'\: Ø} on random access machines where the number of registers is bounded by an arbitrary function of n. nontrivial (i.e', superlinear) optimal lower bound on the computa problem on a random acc€ss machine' We will also show that (n log n) is relatively stable insofar"as it remains valid if we attach an a...
متن کاملAn Improved Lower Bound for Crossing Numbers
The crossing number of a graph G = (V,E), denoted by cr(G), is the smallest number of edge crossings in any drawing of G in the plane. Leighton [14] proved that for any n-vertex graph G of bounded degree, its crossing number satisfies cr(G) + n = Ω(bw(G)), where bw(G) is the bisection width of G. The lower bound method was extended for graphs of arbitrary vertex degrees to cr(G)+ 1 16 ∑ v∈G d 2...
متن کاملA Lower Bound for Schur Numbers and Multicolor Ramsey Numbers
For k ≥ 5, we establish new lower bounds on the Schur numbers S(k) and on the k-color Ramsey numbers of K3. For integers m and n, let [m,n] denote the set {i |m ≤ i ≤ n}. A set S of integers is called sum-free if i, j ∈ S implies i + j 6∈ S, where we allow i = j. The Schur function S(k) is defined for all positive integers as the maximum n such that [1, n] can be partitioned into k sum-free set...
متن کاملNumbers with Integer Complexity Close to the Lower Bound
WARNING: OLD DRAFT. Define f(n) to be the integer complexity of n, the smallest number of ones needed to write n using an arbitrary combination of addition and multiplication. John Selfridge showed that f(n) ≥ 3 log3 n for all n. Define d(n) = f(n) − 3 log3 n; in this paper we present a method for classifying all n with d(n) < r for a given r. From this, we derive a number of consequences. We p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1988
ISSN: 0022-0000
DOI: 10.1016/0022-0000(88)90032-3