Decomposition of arithmetical np-hard problems

DOI10.1080/00207169308804190zbMath0813.68104OpenAlexW2115640374MaRDI QIDQ4323719

Petr Mejzlík

Publication date: 20 February 1995

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169308804190

zbMATH Keywords

hypergraphNP-hard problemcausal networks

Mathematics Subject Classification ID

Artificial intelligence (68T99) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Distribution theory (60E99)

Cites Work

• Probability functions on complex pedigrees
• Computing the Minimum Fill-In is NP-Complete

This page was built for publication: Decomposition of arithmetical np-hard problems