CACrown ArchivesHistory · sources · collections
EN/FR
Search
Menu
Research dossier · General Reference

Reduction (complexity)

Transformation of one computational problem to another

Cross-disciplinary reference desk with index cards, atlas, dictionary and catalogue
General referenceInterpretive dossier study · Crown Archives visual atlas
Record originEnglish Wikipedia
Text licenseCC BY-SA 4.0
Source revisionDec 10, 2025
Entity authoritySource title only
Source-derived summary

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.

Editorial summary

This brief starts where responsible research should: with the source description of “Reduction (complexity)” as transformation of one computational problem to another. Everything that follows is an evidence route, not borrowed authority.

Editorial reviewA dependable orientation record for establishing vocabulary, names and a first evidence trail. The current 45-word lead offers orientation but no explicit four-digit date, so chronology should not be assumed. The selected authority fields contribute no independent date. The account is most persuasive where Reduction, complexity and Transformation can be independently traced.
Editorial analysis

Why this record matters

The subject matters to the general reference register because the source frames it as transformation of one computational problem to another. Its deeper value depends on whether names, dates, institutions and citations support that framing.

Evidence profile

The citation trail is more important than the brevity of the summary: it shows where individual claims can be examined in context. The source revision retrieved here is dated Dec 10, 2025.

Critical limits

The absence of detail may reflect summary conventions rather than a lack of surviving documentation. The source lead contains qualifying language; that uncertainty should survive quotation, summary and reuse. Authority statements aid reconciliation but still require their own references, qualifiers and ranks to be checked.

How to read it

Use the entry as an orientation point, then follow its citations and revision history. Names, dates and institutional relationships should be checked against the original record.

Best used for
  • Subject orientation
  • Search vocabulary
  • Locating named sources
Verify next

The closest primary source, responsible institution and strongest cited specialist reference.

Three-step research path

  1. Establish the record: confirm the title “Reduction (complexity)”, its source revision and the description used here.
  2. Expand the search: follow Reduction (complexity) primary sources, Reduction (complexity) archive and Reduction research across catalogues and specialist indexes.
  3. Test the account: compare the strongest cited source with the responsible institution’s current record and note any disagreement.

Questions for further research

  1. Which source most directly establishes the central claim about “Reduction (complexity)”?
  2. Which cited source is closest to the event, object or claim?
  3. What terminology or title could unlock a more precise catalogue search?
Subject index

Search terms from this dossier

Source & attribution

This entry incorporates text from “Reduction (complexity)” on English Wikipedia. Contributors are listed in the page history. Text is available under the Creative Commons Attribution-ShareAlike 4.0 License. Selected authority identifiers and statements are retrieved from Wikidata under CC0; their references and qualifiers remain part of the verification path.