The Hardness of Speeding-up Knapsack
نویسندگان
چکیده
منابع مشابه
The Hardness of Speeding-up Knapsack
We show that it is not possible to speed-up the Knapsack problem efficiently in the parallel algebraic decision tree model. More specifically, we prove that any parallel algorithm in the fixed degree algebraic decision tree model that solves the decision version of the Knapsack problem requires Ω( √ n) rounds even by using 2 √ n processors. We extend the result to the PRAM model without bit-ope...
متن کاملSpeeding up the Memory
Scalable Flat Cache Only Memory Architectures (Flat COMA) are designed for reduced memory access latencies while minimizing programmer and operating system involvement. Indeed, to keep memory access latencies low, neither the programmer needs to perform clever data placement nor the operating system needs to perform page migration. The hardware automatically replicates the data and migrates it ...
متن کاملSpeeding up the ESG Algorithm
Local search (LS) methods heuristically find a solution for constraint satisfaction problems (CSP). LS starts the search for a solution from a random assignment. LS then examines the neighbours of this assignment to determine a better neighbour valuation to move to. It repeats this process of moving from the current assignment to a better assignment until it finds a solution that satisfies all ...
متن کاملExponentiation : Speeding up the Computation
In lecture notes 9, section 4, we explained how to control the growth in the lengths of numbers when computing me mod n, for numbers m, e, and n which are 1024 bits long. Nevertheless, there is still a problem with the naive exponentiation algorithm that simply multiplies m by itself a total of e − 1 times. Since the value of e is roughly 21024, roughly that many iterations of the main loop wou...
متن کاملSpeeding up the Stress Analysis of Hollow Circular FGM Cylinders by Parallel Finite Element Method
In this article, a parallel computer program is implemented, based on Finite Element Method, to speed up the analysis of hollow circular cylinders, made from Functionally Graded Materials (FGMs). FGMs are inhomogeneous materials, which their composition gradually varies over volume. In parallel processing, an algorithm is first divided to independent tasks, which may use individual or shared da...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BRICS Report Series
سال: 1998
ISSN: 1601-5355,0909-0878
DOI: 10.7146/brics.v5i14.19286