𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Finding smooth maps is NP-complete

✍ Scribed by Jan Poland


Book ID
104136872
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
110 KB
Volume
85
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Finding MAPs for belief networks is NP-h
✍ Solomon Eyal Shimony πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 638 KB

Given a probabilistic world model, an important problem is to find the maximum a-posteriori probability (MAP) instantiation of all the random variables given the evidence. Numerous researchers using such models employ some graph representation for the distributions, such as a Bayesian belief network

Cyclic ordering is NP-complete
✍ Zvi Galil; Nimrod Megiddo πŸ“‚ Article πŸ“… 1977 πŸ› Elsevier Science 🌐 English βš– 478 KB
Planar 3DM is NP-complete
✍ M.E Dyer; A.M Frieze πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 591 KB
Tensor rank is NP-complete
✍ Johan HΓ₯stad πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 524 KB