Everything About ___
Live briefing

Everything about Reduction (complexity)

Transformation of one computational problem to another

In computability theory and computational complexity theory, a reduction is an algorithm for transforming one problem into another problem. A sufficiently efficient reduction from one problem to another may be used to show that the second problem is at least as difficult as the first. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: Reduction (complexity)A 5-minute orientation
  2. Skim a recent paper: Transformer for Nonintrusive Load Monitoring: Complexity Reduction and TransferabilityInfluential work since 2022
  3. Pick up a classic book: Study of one- and two-dimensional filtering and deconvolution algorithms for a streaming array computerThe most-reprinted book on the subject
  4. Read the landmark paper: Gene number, noise reduction and biological complexityCited 353 times
  5. Go sideways: NP-hardnessA closely related topic
  6. Go sideways: Many-one reductionA closely related topic

📖 Definitions

No dictionary entry for this exact phrase.

🗂️ The subject at a glance

  1. Introduction
  2. Properties
  3. Types and applications of reductions
  4. Examples

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics