184.215 Complexity Analysis
This course is in all assigned curricula part of the STEOP.
This course is in at least 1 assigned curriculum part of the STEOP.

2023S, VU, 2.0h, 3.0EC, to be held in blocked form
TUWEL

Properties

  • Semester hours: 2.0
  • Credits: 3.0
  • Type: VU Lecture and Exercise
  • Format: Online

Learning outcomes

After successful completion of the course, students are able to analyze and classify computational problems, mainly located in the area of logic-based AI, with tools from computational complexity theory.

Subject of course

Problem solving methods whith are connected with intelligent systems, via methods of complexity theory. Design of efficient algorithms starting from the analysis of the complexity of problems on exemplaric intelligent systems.

ECTS breakdown: 3 ECTS = 75 Hours

  • Lecture presentation 0.5h
  • Lecture 17.5h
  • Further reading 25h
  • Discussion of the exercises 1.5h
  • Solving the exercises 30h
  • Oral exam (if applicable) 0.5h

Teaching methods

computational complexiy theory, mathematical analysis, formal proofs, use cases, problem solving heuristics

Mode of examination

Written

Additional information

Course in block form, March/April - May, planned for physical attendance.

If physical meetings will not be possible, for Distance Learning the plan would be:

  • Lecture recordings, slides made available
  • Questions and Answers (Q+A) sessions
  • Discussion of exercises

Class schedule: Monday morning, 9:00 -12:30
                          (change after Easter break, tbd)

First Meeting: Monday, March 27, 2023

Further information by TISS-notifications in due time.

Lecturers

Institute

Course dates

DayTimeDateLocationDescription
Mon09:00 - 13:0006.03.2023 - 26.06.2023Seminarraum FAV EG C (Seminarraum Gödel) Lecture
Fri09:00 - 13:0021.04.2023 - 05.05.2023Seminarraum FAV 01 A (Seminarraum 183/2) Complexity Analysis
Fri09:00 - 13:0012.05.2023Seminarraum FAV EG B (Seminarraum von Neumann) VU Complexity Analysis
Complexity Analysis - Single appointments
DayDateTimeLocationDescription
Mon06.03.202309:00 - 13:00Seminarraum FAV EG C (Seminarraum Gödel) Lecture
Mon13.03.202309:00 - 13:00Seminarraum FAV EG C (Seminarraum Gödel) Lecture
Mon20.03.202309:00 - 13:00Seminarraum FAV EG C (Seminarraum Gödel) Lecture
Mon27.03.202309:00 - 13:00Seminarraum FAV EG C (Seminarraum Gödel) Lecture
Mon17.04.202309:00 - 13:00Seminarraum FAV EG C (Seminarraum Gödel) Lecture
Fri21.04.202309:00 - 13:00Seminarraum FAV 01 A (Seminarraum 183/2) Complexity Analysis
Mon24.04.202309:00 - 13:00Seminarraum FAV EG C (Seminarraum Gödel) Lecture
Fri28.04.202309:00 - 13:00Seminarraum FAV 01 A (Seminarraum 183/2) Complexity Analysis
Fri05.05.202309:00 - 13:00Seminarraum FAV 01 A (Seminarraum 183/2) Complexity Analysis
Mon08.05.202309:00 - 13:00Seminarraum FAV EG C (Seminarraum Gödel) Lecture
Fri12.05.202309:00 - 13:00Seminarraum FAV EG B (Seminarraum von Neumann) VU Complexity Analysis
Mon15.05.202309:00 - 13:00Seminarraum FAV EG C (Seminarraum Gödel) Lecture
Mon22.05.202309:00 - 13:00Seminarraum FAV EG C (Seminarraum Gödel) Lecture
Mon05.06.202309:00 - 13:00Seminarraum FAV EG C (Seminarraum Gödel) Lecture
Mon12.06.202309:00 - 13:00Seminarraum FAV EG C (Seminarraum Gödel) Lecture
Mon19.06.202309:00 - 13:00Seminarraum FAV EG C (Seminarraum Gödel) Lecture
Mon26.06.202309:00 - 13:00Seminarraum FAV EG C (Seminarraum Gödel) Lecture
Course is held blocked

Examination modalities

  • exercises (exercise part);
  • take-home exam with optional oral exam, respectively oral follow-up questions to check the plausibility of answers.

Technical requirements:

  •  exercises / take home exam (open book): email / file upload
  • oral exam / follow-up questions: intenet connection, webcam, browser, audio-set. In case physical meetings are possible, this is not needed.

Specific details will be given in due time.

Course registration

Begin End Deregistration end
14.02.2023 20:00 26.05.2023 11:00 26.05.2023 22:00

Curricula

Literature

Previous knowledge

basic knowledge of concepts in theoretical computer science (Turing machine model, computation, algorithms) and logic (Boolean logic)

Miscellaneous

  • Attendance Required!

Language

English