CS-E4700 - Logic and Hard Computational Problems D, Lecture, 6.9.2022-17.11.2022

Guest access
Please note! Course description is confirmed for two academic years, which means that in general, e.g. Learning outcomes, assessment methods and key content stays unchanged. However, via course syllabus, it is possible to specify or change the course execution in each realization of the course, such as how the contact sessions are organized, assessment methods weighted or materials used.

LEARNING OUTCOMES

This course introduces you to the logical formalization of mathematical reasoning and to the mathematics of computational intractability. You learn to work with and reason using propositional logic and first-order logic. You learn how to prove that a computational problem is at least as hard as another computational problem by presenting an efficient reduction from the latter to the former. You know the problem classes P and NP, as well as the hardest problems in the class NP, namely the NP-complete problems. You learn how to prove that a computational problem is NP-complete.

Credits: 5

Schedule: 06.09.2022 - 17.11.2022

Teacher in charge (valid for whole curriculum period):

Teacher in charge (applies in this implementation): Petteri Kaski

Contact information for the course (applies in this implementation):

CEFR level (valid for whole curriculum period):

Language of instruction and studies (applies in this implementation):

Teaching language: English. Languages of study attainment: English

CONTENT, ASSESSMENT AND WORKLOAD

Content

  • valid for whole curriculum period:

    Propositional logic and first-order logic. Formulas, models, validity, satisfiability; axioms and proofs, soundness and completeness; logic circuits. Computational hardness, reductions between problems, the classes P and NP; NP-completeness, the Cook-Levin Theorem.

Assessment Methods and Criteria

  • valid for whole curriculum period:

    Points earned from weekly problem sets determine the course grade.

Workload

  • valid for whole curriculum period:

    Lectures. Teaching in small groups. Independent work. 

DETAILS

Substitutes for Courses
Prerequisites

FURTHER INFORMATION

Further Information

  • valid for whole curriculum period:

    Workload over 12 weeks: each week consists of lecture (2h), Q&A session reviewing the weekly problem set (2h), as well as independent work (7h) in solving the weekly problem set. Total 135h. 

    Teaching Language : English

    Teaching Period : 2022-2023 Autumn I - II
    2023-2024 Autumn I - II

Rules of Conduct - Students´ Rights and Responsibilities (in force from 1 August 2020)

Aalto University Code of Academic Integrity and Handling Violations Thereof