Introduction to Complexity Theory

From Wikiversity
Jump to navigation Jump to search


[edit | edit source]

Complexity theory is the study of the resources (especially computation time and memory) required by algorithms.

Learning Project Summary

[edit | edit source]
  • Project code:
  • Suggested Prerequisites:
    • Students should be familiar with the concepts of deterministic and nondeterministic computation, and formal models of computation, such as finite state automata and Turing machines.
    • Students should also be familiar with the theory of formal languages
  • Time investment:
  • Assessment suggestions:
  • School: School of Computer science
  • Department: Institute for Complexity Theory
  • Stream
  • Level:


[edit | edit source]

The introduction to complexity theory course will offer a comprehensive course in complexity theory .


[edit | edit source]
Subject classification: this is a mathematics resource.
Educational level: this is a tertiary (university) resource.


[edit | edit source]

Tests and Quizzes

[edit | edit source]

Reading Material

[edit | edit source]

Active participants

[edit | edit source]

Please sign below if you are participating in this topic. Use 4 tildes (~) to sign.