✦ LIBER ✦

Processor-time tradeoffs in PRAM simulations

✍ Scribed by Prabhakar Ragde

Book ID: 103159295
Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 794 KB
Volume: 44
Category: Article
ISSN: 0022-0000
DOI: 10.1016/0022-0000(92)90006-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Processor—Time Tradeoffs under Bounded-S

Processor—Time Tradeoffs under Bounded-Speed Message Propagation: Part I, Upper Bounds

✍ G. Bilardi; F. P. Preparata 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 303 KB

Processor—Time Tradeoffs under Bounded-S

Processor—Time Tradeoffs under Bounded-Speed Message Propagation: Part II, Lower Bounds

✍ G. Bilardi; F. P. Preparata 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 261 KB

Improved memory utilization in determini

Improved memory utilization in deterministic PRAM simulation

✍ Yonatan Aumann; Assaf Schuster 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 745 KB

Simulated annealing for the QAP — Optima

Simulated annealing for the QAP — Optimal tradeoff between simulation time and solution quality

✍ Per S. Laursen 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 487 KB

Time-Space Tradeoffs in Algebraic Comple

Time-Space Tradeoffs in Algebraic Complexity Theory

✍ M. Aldaz; J. Heintz; G. Matera; J.L. Montaña; L.M. Pardo 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 294 KB

We exhibit a new method for showing lower bounds for time-space tradeoffs of polynomial evaluation procedures given by straight-line programs. From the tradeoff results obtained by this method we deduce lower space bounds for polynomial evaluation procedures running in optimal nonscalar time. Time,

Time-Space Tradeoff in Derandomizing Pro

Time-Space Tradeoff in Derandomizing Probabilistic Logspace

✍ Jin-Yi Cai; Venkatesan T. Chakaravarthy; Dieter van Melkebeek 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 327 KB