Course: Topological Methods in Computer Science

» List of faculties » PRF » KMI
Course title Topological Methods in Computer Science
Course code KMI/PGSTO
Organizational form of instruction Lecture
Level of course Doctoral
Year of study not specified
Semester Winter and summer
Number of ECTS credits 12
Language of instruction Czech, English
Status of course unspecified
Form of instruction Face-to-face
Work placements This is not an internship
Recommended optional programme components None
Lecturer(s)
  • Krupka Michal, doc. RNDr. Ph.D.
Course content
Advanced topics of general topology, basic topics of algebraic topology. Applications in Computer Science. General topology. Introduction to homotopy theory. Algebraic topology: singular homology, basics of homological algebra. Computation of homologies: Mayer-Vietoris sequence. Simplicial homology, computation of homologies of simplicial complexes as a discrete problem, simplicial structures for MV-algebras. Algebraic topology of finite spaces. Topology in data analysis. Topology and distributed computing.

Learning activities and teaching methods
unspecified
Learning outcomes
The students become familiar with basic concepts of general and algebraic topology and their applications in selected areas of Computer Science.

Prerequisites
unspecified

Assessment methods and criteria
unspecified
Active participation in class. Completion of assigned homeworks. Passing the oral (or written) exam.
Recommended literature
  • A.J. Zomorodian. (2009). Topology for Computing. Cambridge University Press.
  • J.A. Bermak. (2011). Algebraic Topology of Finite Topological Spaces and Applications. Springer.
  • J.R. Munkers. (2000). Topology.. Pearson.
  • M. Herlihy, N. Shavit. (1999). The Topological Structure of Asynchronous Computability.


Study plans that include the course
Faculty Study plan (Version) Category of Branch/Specialization Recommended year of study Recommended semester