Skip to content
Vinony
Category

Reduction (complexity)

page 1
reduction
transformation of one computational problem to another, used to show that the second problem is as difficult as the first
polynomial-time reduction
method for solving one problem using another
Turing reduction
concept in computability theory
Log-space reduction
type of computational algorithm
L-reduction
In computer science, particularly the study of approximation algorithms, an L-reduction ("linear reduction") is a transformation of optimization problems which linearly preserves approximability features; it is one type of approximation-preserving reduction. L-reductions in studies of approximability of optimization problems play a similar role to that of polynomial reductions in the studies of computational complexity of decision problems.