Aller à : contenu haut bas recherche
 
 
EN     FR
Vous êtes ici:   UNIL > HEC Inst. > HEC App. > SYLLABUS
 
 

Computational Complexity I

  • Teacher(s):  
  • Course given in: English
  • ECTS Credits:
  • Schedule: Autumn Semester 2019-2020, 2.0h. course (weekly average)
  •  sessions
  • Related programmes:
    Master of Science (MSc) in Management, Orientation Strategy, Organization and Leadership

    Master of Science (MSc) in Management, Orientation Marketing

    Maîtrise universitaire ès Sciences en management, Orientation Behaviour, Economics and Evolution

    Master of Science (MSc) in Management, Orientation Business Analytics

 

Objectives

Understanding the basic concepts of computational complexity theory and being able to recognize typical P-complete, NP-complete, PSPACE-complete problems.

Contents


The theory of Computational Complexity focuses on classifying problems that are solvable by computers, relatively to their difficulty -- which is usually measured in how much time is needed or how much space (memory) is required. This leads on one hand to the definition of various complexity classes, and on the other hand to the comparison of computable problems by mean of reduction relations.
This course introduces to the basic concepts of computational complexity theory and gives an overview of some of the major P and NP complete problems by going through the following notions:

- Strings, languages and decision problems

- Finite automata, determinism and non-determinism√A computation model: the Turing machine

- Recursive and recursively enumerable languages and functions

- The universal Turing machine and the halting problem

- Computable and uncomputable, decidability and undecidability

- Space and time efficiency, the big-Oh notation

- Deterministic time and P

- Non-deterministic time and NP

- Reducibility and completeness

- P-complete problems such as circuit value problem, Horn clauses, linear programming, Conway's game of life

- NP-complete problems such as SAT, 3SAT, travelling salesman problem, graph coloring, Hamiltonian path problem

- LOGSPACE, PSPACE, EXPTIME, EXPSPACE.

References

- Sanjeev Arora, Boaz Barak "Computational Complexity: A Modern Approach"

- Oded Goldreich "P, NP, and NP-Completeness: The Basics of Computational Complexity"

- Christos H. Papadimitriou "Computational Complexity"

- Michael Sipser "Introduction to the Theory of Computation"

Pre-requisites

none.

Evaluation

First attempt

Exam:
Written 2h00 hours
Documentation:
Allowed with restrictions
Calculator:
Not allowed
Evaluation:

2-hour written exam. One A4-sheet of personal notes allowed.

Retake

Exam:
Written 2h00 hours
Documentation:
Allowed with restrictions
Calculator:
Not allowed
Evaluation:

idem



[» go back]           [» courses list]
 
Search


Internef - CH-1015 Lausanne - Suisse  -   Tél. +41 21 692 33 00  -   Fax +41 21 692 33 05
Swiss University