## REDUCTION

### Reduction

In computability theory and computational complexity theory, a**reduction**is an algorithm for transforming one problem into another problem. A reduction from one problem to another may be used to show that the second problem is as difficult as the first. The mathematical structure generated on a set of problems by the reductions of a particular type generally forms a preorder, whose equivalence classes may be used to define degrees of unsolvability and complexity classes.

*The above text is a snippet from Wikipedia: Reduction (complexity)*

and as such is available under the Creative Commons Attribution/Share-Alike License.

and as such is available under the Creative Commons Attribution/Share-Alike License.

### reduction

#### Noun

- The act, process, or result of reducing.
- The amount or rate by which something is reduced, e.g. in price.
*A 5%***reduction**in robberies

- A reaction in which electrons are gained and valence is reduced; often by the removal of oxygen or the addition of hydrogen.
- The process of rapidly boiling a sauce to concentrate it.
- The rewriting of an expression into a simpler form.
- a transformation of one problem into another problem, such as mapping reduction or polynomial reduction.
- An arrangement for a far smaller number of parties, e.g. a keyboard solo based on a full opera.
- A philosophical procedure intended to reveal the objects of consciousness as pure phenomena. (See phenomenological reduction.)
- A medical procedure to restore a fracture or dislocation to the correct alignment.

*The above text is a snippet from Wiktionary: reduction*

and as such is available under the Creative Commons Attribution/Share-Alike License.

and as such is available under the Creative Commons Attribution/Share-Alike License.