MA5011 - Complexity
Know to grasp and to calculate the complexity of an algorithm.
Know to recognise difficult combinatorics problems (NP hardness).
Basic definitions and concepts (attributes, means, obstacles)
Measures of dependability (stabilised reliability and growing reliability)
Assessment of stabilised reliability
Assessment of error tolerance
Assessment of reliability growth
Characterisation and measure of reliability growth
Trend test and models of reliability growth
- Lectures : 23
This course is part of the programme
ECTS credits : cf Teaching Unit
Number of hours 23
Phone : +33 5 62 25 95 06
Phone : +33 5 62 25 95 84