𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the complexity of global computation in the presence of link failures: the general case

✍ Scribed by Y. Afek; D. Hendler

Publisher
Springer-Verlag
Year
1995
Tongue
English
Weight
823 KB
Volume
8
Category
Article
ISSN
0178-2770

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Computational complexity of planning and
Computational complexity of planning and approximate planning in the presence of incompleteness
✍ Chitta Baral; Vladik Kreinovich; RaΓΊl Trejo πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 213 KB

In the last several years, there have been several studies about the computational complexity of classical planning assuming that the planner has complete knowledge about the initial situation. Recently, there have been proposals to use 'sensing' actions to plan in the presence of incompleteness. In

On the complexity of categoricity in com
On the complexity of categoricity in computable structures
✍ Walker M. White πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 192 KB

## Abstract We investigate the computational complexity the class of Γ‐categorical computable structures. We show that hyperarithmetic categoricity is Ξ ^1^~1~‐complete, while computable categoricity is Ξ ^0^~4~‐hard. (Β© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)