Composition is almost (but not quite) as good as s-1-1
نویسندگان
چکیده
منابع مشابه
Composition is Almost (but not Quite) as Good as s-1-1
We establish a polynomial upper bound on the time complexity of an s-1-1 function in programming systems with a linear time composition function. This improves the double-exponential upper bound of Machtey and Young [9], the only previously known upper bound, and invalidates the belief expressed twice in the literature [8, 19] that it could not be significantly improved. We then show our upper ...
متن کاملComposition as Identity: Part 1
Many of us think that ordinary objects – such as tables and chairs – exist. We also think that ordinary objects have parts: my chair has a seat and some legs as parts, for example. But once we are committed to the (seemingly innocuous) thesis that ordinary objects are composed of parts, we then open ourselves up to a whole host of philosophical problems, most of which center on what exactly the...
متن کاملAsynchronous PRAMs Are (Almost) as Good as Synchronous PRAMs
We introduce a PRAM model which allows processors to have arbitrary asynchronous behavior. Our main result shows that any n-processor CRCW PRAM program can be simulated on an asynchronous CRCW PRAM using O(n) expected work per parallel step, and using up to lo ,yor , asynchronous processors. We achieve this result despite the fact that our work measure counts all instructions, including busy wa...
متن کاملNot as Good as it Looks.
tion, and the lipidized DF, with a homogeneous yellowish area.3,6 Although initially considered rare, sebaceous structures are identified in more than 15% of DFs,4,5,7 even in multiple forms.8 This finding is typical in lesions localized in the anatomical area of the shoulder (shoulder, proximal region of the arm, upper back and deltoid region), being observed in more than 40% of these cases, p...
متن کاملThe Johnson-Lindenstrauss lemma almost characterizes Hilbert space, but not quite
Let X be a normed space that satisfies the Johnson-Lindenstrauss lemma (J-L lemma, in short) in the sense that for any integer n and any x1, . . . , xn ∈ X there exists a linear mapping L : X → F, where F ⊆ X is a linear subspace of dimension O(log n), such that ‖xi − x j‖ ≤ ‖L(xi) − L(x j)‖ ≤ O(1) · ‖xi − x j‖ for all i, j ∈ {1, . . . , n}. We show that this implies that X is almost Euclidean ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1993
ISSN: 0304-3975
DOI: 10.1016/0304-3975(93)90286-3