#P Complete is my favorite 'harder than NP Complete' class. Discovering if a 3-SAT problem has Zero solutions is a famous NP complete problem. #P is very easy

#P Complete is my favorite 'harder than NP Complete' class. Discovering if a 3-SAT problem has Zero solutions is a famous NP complete problem. #P is very easy to understand as an extension. Instead of asking for 'Is there more than zero solutions?', you ask 'How many solutions are there?' And bam, you've gone from NP complete to #P complete. One of the easiest ways to make NP complete problems even harder. -------- All NP Complete algorithms can be solved by a #P complete algorithm. Just ask for the count, return true if count > 0. Return false if count == 0. Therefore, NP Complete is proven to be easier (or worst case, tied with) #P Complete space.