containment problem.

Function problems

A similar situation exists between the functional classes FP and . By a generalization of Ladner's theorem, there are also problems in neither FP nor as long as FP != #P. As in the decision case, a problem in the #CSP is defined by a set of relations. Each problem takes a Boolean formula

1.Previous
3.Next