Usted está aquí: Inicio Ingeniería Informática Formal Languages and Automata Theory Material de clase Unit 8. Computational Complexity

Unit 8. Computational Complexity

Acciones de Documento
  • Marcadores (bookmarks)
Autores: DAVID GRIOL BARRES, ARACELI SANCHIS DE MIGUEL, MARÍA PAZ SESMERO LORENTE, AGAPITO LEDEZMA ESPINO, JUAN MANUEL ALONSO WEBER
Complexity Theory Complexity of algorithms P versus NP problems Defining complexity classes Time complexity Hierarchy theorems Non-computational problems Limits of Computability

Unit8TALFOCW.pdf — PDF document, 662 kB (677891 bytes)

Reutilizar Curso
Descargar este curso