Maximum satisfiability Problem: Computational complexity theory, Propositional formula, NP-hard, Boolean problem, NP-complete, APX

Pseudo-Polynomial Time: Computational Complexity Theory, Time Complexity, NP-Complete, NP-Hard

Weakly NP Complete: Computational Complexity, Complete, Hard

Set Packing: NP Complete, Computational Complexity Theory, Combinatorics

complexity Class: Computational theory, problem, Abstract machine, Big O notation, NP (complexity),...