Logo
Unionpedia
Communication
Get it on Google Play
New! Download Unionpedia on your Android™ device!
Install
Faster access than browser!
 

Reduction (complexity) and Tetris

Shortcuts: Differences, Similarities, Jaccard Similarity Coefficient, References.

Difference between Reduction (complexity) and Tetris

Reduction (complexity) vs. Tetris

In computability theory and computational complexity theory, a reduction is an algorithm for transforming one problem into another problem. Tetris (Тетрис) is a tile-matching puzzle video game, originally designed and programmed by Russian game designer Alexey Pajitnov.

Similarities between Reduction (complexity) and Tetris

Reduction (complexity) and Tetris have 3 things in common (in Unionpedia): Computational complexity theory, Hardness of approximation, NP-completeness.

Computational complexity theory

Computational complexity theory is a branch of the theory of computation in theoretical computer science that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other.

Computational complexity theory and Reduction (complexity) · Computational complexity theory and Tetris · See more »

Hardness of approximation

In computer science, hardness of approximation is a field that studies the algorithmic complexity of finding near-optimal solutions to optimization problems.

Hardness of approximation and Reduction (complexity) · Hardness of approximation and Tetris · See more »

NP-completeness

In computational complexity theory, an NP-complete decision problem is one belonging to both the NP and the NP-hard complexity classes.

NP-completeness and Reduction (complexity) · NP-completeness and Tetris · See more »

The list above answers the following questions

Reduction (complexity) and Tetris Comparison

Reduction (complexity) has 43 relations, while Tetris has 221. As they have in common 3, the Jaccard index is 1.14% = 3 / (43 + 221).

References

This article shows the relationship between Reduction (complexity) and Tetris. To access each article from which the information was extracted, please visit:

Hey! We are on Facebook now! »