Ändringar mellan två versioner
Här visas ändringar i "Contents" mellan 2016-01-11 16:01 av Johan Karlander och 2016-01-26 22:36 av Johan Karlander.
Prior to courseContents
Course content Principles for construction of algorithms: Decomposition, greedy algorithms, dynamic programming. Algorithm analysis. Probalistic algorithms. Approximation. Selected applications to sets, graphs, arithmetic, and geometry.
Computability and complexity: Reduction. Complexity classes P (polynomial time), NP (non-deterministic polynomial time), and NC (efficiently parallelizable problems). NP-complete problems. Undecidable problems.
_________________________________________________________________________
This site contains:¶ ¶
* Aim
* Required reading