Subject:
Computer Science (CS)
Catalog number:
764
Unit weight:
0.50
Meet type:
LEC
Grading basis:
NUM
Cross-listing(s):
N/A
Requisites:
Antireq: CS 664
Description:
Further exposure to the classification of problems based on their computational requirements and to mathematical tools designed to explore the structural consequences of such classifications. Topics include relativization, alternation, provably intractable problems, feasible parallel computation; fixed-parameter tractability and the W-hierarchy; Kolmogorov complexity, including algorithmic and algorithmic prefix complexity and their applications.
Topic titles:
N/A
Faculty:
Mathematics (MAT)
Academic level:
GRD
Course ID:
011298
