Descriptif
Prerequisites:
CSE202, CSE203, CSE206
Theoretical Computer Science has shown
that computational problems can be classified
according to how difficult they are
to solve. We now know that some problems
are intrinsically impossible to solve
in a reasonable amount of time, or with
a reasonable amount of resources. This
course describes the rigorous model of
computation required to compare and
classify computational problems and their
difficulty, giving an introduction to the
theory of computational complexity and
the standard complexity classes.
CSE202, CSE203, CSE206
Theoretical Computer Science has shown
that computational problems can be classified
according to how difficult they are
to solve. We now know that some problems
are intrinsically impossible to solve
in a reasonable amount of time, or with
a reasonable amount of resources. This
course describes the rigorous model of
computation required to compare and
classify computational problems and their
difficulty, giving an introduction to the
theory of computational complexity and
the standard complexity classes.
Diplôme(s) concerné(s)
Parcours de rattachement
Pour les étudiants du diplôme Bachelor of Science de l'Ecole polytechnique
Vous devez avoir validé l'équation suivante : UE CSE202 Et UE CSE203 Et UE CSE206
Format des notes
Numérique sur 20Littérale/grade américainPour les étudiants du diplôme Bachelor of Science de l'Ecole polytechnique
Le rattrapage est autorisé (Note de rattrapage conservée écrêtée à une note seuil de 9)- Crédits ECTS acquis : 4 ECTS
La note obtenue rentre dans le calcul de votre GPA.