Search Course Outline

Search

5 course outlines found

1

COMPSCI 750

: Computational Complexity
2024 Semester Two (1245)
Definitions of computational models and complexity classes: time complexity (e.g., P and NP), space complexity (e.g., L and PSPACE), circuit and parallel complexity (NC), polynomial-time hierarchy (PH), interactive complexity (IP), probabilistic complexity (BPP), and fixed-parameter complexity. Recommended preparation: COMPSCI 320 or 350
Subject: Computer Science
No pre-requisites or restrictions
2

COMPSCI 750

: Computational Complexity
2023 Semester Two (1235)
Definitions of computational models and complexity classes: time complexity (e.g., P and NP), space complexity (e.g., L and PSPACE), circuit and parallel complexity (NC), polynomial-time hierarchy (PH), interactive complexity (IP), probabilistic complexity (BPP), and fixed-parameter complexity. Recommended preparation: COMPSCI 320 or 350.
Subject: Computer Science
Prerequisite: Approval of the Academic Head or nominee
3

COMPSCI 750

: Computational Complexity
2022 Semester Two (1225)
Definitions of computational models and complexity classes: time complexity (e.g., P and NP), space complexity (e.g., L and PSPACE), circuit and parallel complexity (NC), polynomial-time hierarchy (PH), interactive complexity (IP), probabilistic complexity (BPP), and fixed-parameter complexity. Recommended preparation: COMPSCI 320 or 350.
Subject: Computer Science
Prerequisite: Approval of the Academic Head or nominee
4

COMPSCI 750

: Computational Complexity
2021 Semester Two (1215)
Definitions of computational models and complexity classes: time complexity (e.g., P and NP), space complexity (e.g., L and PSPACE), circuit and parallel complexity (NC), polynomial-time hierarchy (PH), interactive complexity (IP), probabilistic complexity (BPP), and fixed-parameter complexity. Recommended preparation: COMPSCI 320 or 350.
Subject: Computer Science
Prerequisite: Approval of the Academic Head or nominee
5

COMPSCI 750

: Computational Complexity
2020 Semester Two (1205)
Definitions of computational models and complexity classes: time complexity (e.g., P and NP), space complexity (e.g., L and PSPACE), circuit and parallel complexity (NC), polynomial-time hierarchy (PH), interactive complexity (IP), probabilistic complexity (BPP), and fixed-parameter complexity. Recommended preparation: COMPSCI 320 or 350.
Subject: Computer Science
Prerequisite: Approval of the Academic Head or nominee