✦ LIBER ✦

On the power of randomized multicounter machines

✍ Scribed by Juraj Hromkovič; Georg Schnitger

Book ID: 108280996
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 194 KB
Volume: 330
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.09.015

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of decision problems for

The complexity of decision problems for finite-turn multicounter machines

✍ Eitan M. Gurari; Oscar H. Ibarra 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 694 KB

On the computing power of fuzzy Turing m

On the computing power of fuzzy Turing machines

✍ Benjamín Callejas Bedregal; Santiago Figueira 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 216 KB

On the Power of Unambiguity in Alternati

On the Power of Unambiguity in Alternating Machines

✍ Holger Spakowski; Rahul Tripathi 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 543 KB

On the Power of the Randomized Iterate

✍ Haitner, Iftach; Harnik, Danny; Reingold, Omer 📂 Article 📅 2011 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 522 KB

Limits on the power of concurrent-write

Limits on the power of concurrent-write parallel machines

✍ Paul Beame 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 946 KB

Limits on the Power of Parallel Random A

Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution

✍ Faith E. Fich; Russell Impagliazzo; Bruce Kapron; Valerie King; Mirosław Kutyłow 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 403 KB

The ROBUST PRAM is a concurrent-read concurrent-write (CRCW) parallel random access machine in which any value might appear in a memory cell as a result of a write conflict. This paper addresses the question of whether a PRAM with such a weak form of write conflict resolution can compute functions f