Trade-offs between communication and space
نویسندگان
چکیده
منابع مشابه
Time-space Trade-offs for Voronoi Diagrams
Let S be a planar n-point set. Classically, one can find the Voronoi diagram VD(S) for S in O(n log n) time and O(n) space. We study the situation when the available workspace is limited: for s ∈ {1, . . . , n}, an s-workspace algorithm has read-only access to an input array with the points from S in arbitrary order, and it may use only O(s) additional words of Θ(log n) bits for reading and wri...
متن کاملOptimal Time-Space Trade-Offs for Sorting
We study the fundamental problem of sorting in a sequential model of computation and in particular consider the time-space trade-off (product of time and space) for this problem. Beame has shown a lower bound of Ω(n) for this product leaving a gap of a logarithmic factor up to the previously best known upper bound of O(n log n) due to Frederickson. Since then, no progress has been made towards ...
متن کاملSupercritical Space-Width Trade-Offs for Resolution
We show that there are CNF formulas which can be refuted in resolution in both small space and small width, but for which any small-width resolution proof must have space exceeding by far the linear worst-case upper bound. This significantly strengthens the space-width trade-offs in [BenSasson 2009], and provides one more example of trade-offs in the “supercritical” regime above worst case rece...
متن کاملTime-Space Trade-offs in Population Protocols
Population protocols are a popular model of distributed computing, in which randomly-interacting agents with little computational power cooperate to jointly perform computational tasks. Inspired by developments in molecular computation, and in particular DNA computing, recent algorithmic work has focused on the complexity of solving simple yet fundamental tasks in the population model, such as ...
متن کاملInformation trade-offs for optical quantum communication
Recent work has precisely characterized the achievable trade-offs between three key information processing tasks-classical communication (generation or consumption), quantum communication (generation or consumption), and shared entanglement (distribution or consumption), measured in bits, qubits, and ebits per channel use, respectively. Slices and corner points of this three-dimensional region ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1992
ISSN: 0022-0000
DOI: 10.1016/0022-0000(92)90028-h