Preview

Selected image

ISICG1004 - Αλγοριθμική Πολυπλοκότητα (Complexité Algorithmique)

(MSC-ISICG1004) -  Δ. Μάγος

Course Description

Complexité:

Modeles de calcul: machines de Turing, fonctions recursives, calcul lambda.

Calculabilite.

Decidabilite.

Classe de complexite: P, NP, co-NP, problémes NP-complets.

Complexite des algorithmes.

 

Creation Date

Monday, October 6, 2014