Subject:
Computer Science (CS)
Catalog number:
664
Unit weight:
0.50
Meet type:
LEC
Grading basis:
NUM
Cross-listing(s):
N/A
Requisites:
N/A
Description:
The classification of problems according to the computational resources required for their solution, with emphasis on properties of feasible computations rather than on specific algorithms. Topics include: time and space complexity, tractable and intractable problems, computation using randomness, parallel computation.
Topic titles:
N/A
Faculty:
Mathematics (MAT)
Academic level:
GRD
Course ID:
000613
