Algorithm Search⌘K

Definitionadvanced

Parsimonious reduction

Also called one-to-one reduction, parsimonious transformation, solution-count-preserving reduction.

A reduction that preserves the number of solutions, used for hardness of counting problems.

A reduction that preserves the number of solutions, used for hardness of counting problems.

About this page

The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.

LadderLevelWhat the next level needs
Human proofH0 no proof
  • add a proof in proofs/ (06.5)
LeanL0 no Lean part
  • name a Lean module in the lean field (07)
VisualV0 none
  • add viz/scene.ts or a figure (10)
WritingW0 stub
  • one source with a locator