Related complexity classes Clearly, a #P problem must be at least as hard as the corresponding NP problem. If it's easy to count answers, then it must be easy to tell whether there are any answers—just count them and see whether the count is greater than zero. Some of these problems, such as root finding, are easy enough to be in FP, while others are #P-complete.
Related complexity classes Clearly, a #P problem must be at least as hard as the corresponding NP problem If it's easy to count answers then it must be easy to tell whether there are any answers—just count them and see whether the count is greater than zero. Some of these problems, such as root findin,g, are easy enou.gh to be in FP, while others are #P-complete.