We know that MAJSAT is PP-complete. Is it generally true that given an NP-complete problem, its majority variant is PP-complete? For example, MAJ-Set-Splitting: are the majority of partitions of items going to split the sets? MAJ-Subset-Sum: does the majority of partitions of items have a sum of exactly K?etc...
MAX,MAJ variants of NP complete problems
complexity theory