LearnViz CompSci
Home / Learn / Theory & Discrete Math / Approximation and Inapproximability

Advanced Topic 43 of 51 Theory & Discrete Math

Approximation and Inapproximability

Limits on how closely hard problems can be approximated.

How it works

Some NP-hard problems admit constant-factor approximations (vertex cover 2), PTAS, or none unless P = NP (general TSP, clique).

Where it is used

Understanding practical limits.

Common pitfall

Hardness of approximation uses PCP theorem machinery.

Where it fits in the course

Approximation and Inapproximability is topic 43 of 51 in Theory & Discrete Math, rated Advanced. It follows Randomized Complexity. The next topic is Parameterized Complexity.

Practice and explore

How to study this topic

  1. Read the explanation above and restate the definition in your own words.
  2. Open the interactive lesson and answer its mini quiz.
  3. Read the common pitfall, then write a short example that avoids it.
  4. Check your understanding in the Theory & Discrete Math quiz, and revisit the topic if you miss a question.

Frequently asked questions

What is Approximation and Inapproximability?
Limits on how closely hard problems can be approximated. It belongs to Theory & Discrete Math and is an advanced-level topic.
Where do people use Approximation and Inapproximability?
Understanding practical limits.
What is the most common mistake with Approximation and Inapproximability?
Hardness of approximation uses PCP theorem machinery.
What should I learn before this topic?
Start with Randomized Complexity, the topic just before it in Theory & Discrete Math.
How can I practice it?
Answer the mini quiz in the interactive lesson, then take the Theory & Discrete Math quiz.
Is Approximation and Inapproximability hard to learn?
It is an Advanced topic. Expect to read the explanation more than once and to connect it with earlier topics. Working through a small example by hand helps most.
How long does it take to learn Approximation and Inapproximability?
Most learners can read the explanation and finish the interactive lesson in under an hour. Fluency comes from applying the idea, so plan a few short practice sessions with the quiz.
Which topics are related to Approximation and Inapproximability?
Randomized Complexity, Parameterized Complexity, Space Complexity Classes are closely connected. The full list is in the related topics section of this page.
What should I study after Approximation and Inapproximability?
Continue with Parameterized Complexity, the next topic in Theory & Discrete Math.

Related topics