CSC 684

Complexity of Computation

Saint Joseph's University · UGRD · Fall 2026

1 section
Add to a schedule

Catalog description

P and NP problems; NP-complete classes; concrete complexity and the P class of combinatorial problems; complexity reduction on graph and string problems; complexity of algebraic computations.

Sections

Current meeting, instructor, credit, and enrollment details

Updated 5 hours ago

001

Availability not recently verified
Class #saint_joseph_s-CSC684Fall 2026UGRD3 credits
Days & times
No scheduled meeting time
Meeting dates
Location
Instructor
Staff
Class numbers and section codes come from the registrar.
Spot missing or incorrect course data?