As a consequence we prove that no MAX SNP-hard problem has a polynomial time approximation scheme, unless NP=P. The class MAX SNP was defined by Papadimitriou and Yannakakis [82] and hard problems for this class include
…………………………………………………………………………………………………………. यो मुलुक सिंगापुर जस्तो बनिसकेको छैन मात्र राजनीतिक परिवर्तन...