inapproximabilitytuloksiin
Inapproximability results are theoretical statements in computer science that establish fundamental limits on the efficiency of approximation algorithms for certain computational problems. These results often demonstrate that if a problem can be approximated within a certain factor, then a famous computationally hard problem, like P versus NP, would also be solvable efficiently. The typical form of an inapproximability result is that for a specific problem P, there is no polynomial-time approximation scheme (PTAS) unless P=NP, or that it is NP-hard to approximate P within a factor of c, for some constant c.
These results are crucial because they guide researchers away from attempting to find efficient approximation algorithms