Introduction to Complexity Theory

Introduction

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

Learning Project Summary

  • 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:

Goals

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

Course

Subject classification: this is a mathematics resource.
Subject classification: this is an information technology resource.
Educational level: this is a tertiary (university) resource.

Lessons

Tests and Quizzes

Reading Material


Active participants

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

  • Kinkydarkbird 03:35, 5 January 2009 (UTC)
This article is issued from Wikiversity. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.