MIT opencouseware : https://www.youtube.com/user/MIT/search?query=algorithm
23. Computational Complexity
--------|---------|------------|-----------|------------------------>
<--p-->
<-----np------>
NP-CMP
<---------------exp----->
<------------------------- --------="" r="">
1. Tetris is NP-complete
2. Reduction: mapping a new problem A to old problem B.
No comments:
Post a Comment