PK

PKBytes

HomeLearnTechnology
Explore tracks
Chapter 61: Algorithmic Complexity Theory and Approximation
← All DSA chapters

Part X · Chapter 61

Algorithmic Complexity Theory and Approximation
  1. 61.01Problem classes
  2. 61.02Reductions
    1. Polynomial-time reduction
    2. Mapping reduction
    3. NP-completeness proof pattern
  3. 61.03Classic hard problems
  4. 61.04Approximation algorithms
  5. 61.05Parameterized algorithms
  6. 61.06Complexity beyond Big O
  7. 61.07Algorithm design trade-offs
← All DSA chapters

Part X · Chapter 61

Algorithmic Complexity Theory and Approximation
  1. 61.01Problem classes
  2. 61.02Reductions
    1. Polynomial-time reduction
    2. Mapping reduction
    3. NP-completeness proof pattern
  3. 61.03Classic hard problems
  4. 61.04Approximation algorithms
  5. 61.05Parameterized algorithms
  6. 61.06Complexity beyond Big O
  7. 61.07Algorithm design trade-offs
Home/DSA/Algorithmic Complexity Theory and Approximation/Reductions
61.02Advanced / Expert3 topics

Reductions

Part of Chapter 61: Algorithmic Complexity Theory and Approximation.

Outline only

The topics below come from the curriculum. Their written explanations and animations have not been published yet.

61.02.1

Polynomial-time reduction

Explanation coming soon.

61.02.2

Mapping reduction

Explanation coming soon.

61.02.3

NP-completeness proof pattern

Explanation coming soon.

← Previous · 61.01

Problem classes

Next · 61.03 →

Classic hard problems

On this page

  • Polynomial-time reduction
  • Mapping reduction
  • NP-completeness proof pattern