๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Serializability by commitment ordering

โœ Scribed by Yoav Raz

Book ID
103104760
Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
724 KB
Volume
51
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On serializability
On serializability
โœ J. A. Brzozowski; S. Muro ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› Springer ๐ŸŒ English โš– 742 KB
On serializability
On serializability
โœ J.A. Brzozowski; S. Muro ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 62 KB
Universally Serializable Computation
Universally Serializable Computation
โœ Lane A. Hemaspaandra; Mitsunori Ogihara ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 371 KB

Cai and Furst proved that every PSPACE language can be solved via a large number of identical simple tasks, each of which is provided with the original input, its own unique task number, and at most three bits of output from the previous task. In the Cai Furst model, the tasks are required to be run