𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The complexity of colouring symmetric relational systems

✍ Scribed by Richard Brewster

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
752 KB
Volume
49
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the complexity of inference about pro
On the complexity of inference about probabilistic relational models
✍ Manfred Jaeger πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 120 KB

We investigate the complexity of probabilistic inference from knowledge bases that encode probability distributions on finite domain relational structures. Our interest here lies in the complexity in terms of the domain under consideration in a specific application instance. We obtain the result tha