ppt课件-algorithmsand networks n p-completeness（algorithmsand网络n p-completeness）.pptVIP

On PP and #P Inference: Given: probabilistic network, observations O, variable X, value x, value p in [0,1] Question: Pr(X = x | O ) = p? Decision variant of problem from course Probabilistic Reasoning Is PP-complete; variants are #P-complete PP-hard and #P-hard problems are probably not polynomial... Algorithms and Networks: NP-completeness * LSPACE or L Problems can be solved with only logarithmic extra space: You can read the input as often as you want You may use only O(log n) extra memory E.g.: Q(1) pointers to your input NL: non-deterministic logspace... Algorithms and Networks: NP-com