Geometric optimization andD P -completeness
نویسندگان
چکیده
منابع مشابه
Strict Sequential P-completeness
In this paper we present a new notion of what it means for a problem in P to be inherently sequential. Informally, a problem L is strictly sequential P-complete if when the best known sequential algorithm for L has polynomial speedup by parallelization, this implies that all problems in P have a polynomial speedup in the parallel setting. The motivation for defining this class of problems is to...
متن کاملUniversal Relations and #P-Completeness
This paper follows the methodology introduced by Agrawal and Biswas in [AB92], based on a notion of universality for the relations associated with NP-complete problems. The purpose was to study NP-complete problems by examining the effects of reductions on the solution sets of the associated witnessing relations. This provided a useful criterion for NP-completeness while suggesting structural s...
متن کاملQuery Optimization Using Local Completeness
We consider the problem of query plan optimization in information brokers. Information brokers are programs that facilitate access to collections of information sources by hiding source-speciic peculiarities and presenting uniform query interfaces. It is unrealistic to assume that data stored by information sources is complete. Therefore, current implementations of information brokers query all...
متن کاملEecient Algorithms for Geometric Optimization Eecient Algorithms for Geometric Optimization
Linear Programming 15 contain such a constraint), which implies that after kd iterations (H) (B) 2k. Hence, after kd successful rounds, 2k (H) nek=3. This implies that the above algorithm terminates in at most 3d lnn successful rounds. Since each round takes O(dd) time to compute xR and O(dn) time to compute V , the expected running time of the algorithm is O((d2n+dd+1) log n). By combining thi...
متن کاملP-completeness of Cellular Automaton Rule 110
We show that the problem of predicting t steps of the 1D cellular automaton Rule 110 is P-complete. The result is found by showing that Rule 110 simulates deterministic Turing machines in polynomial time. As a corollary we find that the small universal Turing machines of Mathew Cook run in polynomial time, this is an exponential improvement on their previously known simulation time overhead.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 1989
ISSN: 0179-5376,1432-0444
DOI: 10.1007/bf02187711