Tractability of exact inference Flashcards
1
Q
Is exact inference intractable?
A
For polytrees (at most 1 undirected path between any two nodes in the network), the time and space complexity of the exact inference is linear in the size of the network (number of CPT entries). For non-polytrees or multiply connected networks, exact inference techniques like variable inference has exponential time and space complexity.