Complexity
|
Computability and Complexity
Comparing Algorithms Computability and Complexity The final part of the course deals with the issue of assessing how difficult specific computational problems are to solve. Given a description of a particular problem a number of questions arise: Is it possible to design an algorithm which solves the problem Is it possible to design an efficient algorithm which solves the problem How can one ...
www.csc.liv.ac.uk/~ped/teachadmin/algor/comput_complete.html reviews
|
|
| |