CS 613

Advanced Computational Complexity

California State University San Marcos · UGRD · Fall 2026

1 section

Catalog description

In-depth discussion of computational complexity theory including models of computation, polynomially bounded, NP-completeness, reducibility, and beyond NP-completeness, and intractable problems. NP-complete problems in various areas will be discussed. Prerequisite(s): CS 513 .

Sections

Current meeting, instructor, credit, and enrollment details

Updated 5 hours ago

001

Availability not recently verified

Class #california_san_marcos-0747Fall 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?