Creator/Author/Editor: Tacettin, Mustafa2005Tacettin, Mustafa and Ünlüyurt, Tonguç (2005) An alternative proof that exact inference problem in Bayesian belief networks is NP-hard. Lecture notes in computer science, 3733 . pp. 947-955. ISSN 0302-9743 (Print) 1611-3349 (Online) 2002Tacettin, Mustafa (2002) A Polynomial transformation from vertex cover problem to exact inference problem in bayesian belief networks. [Thesis] |