CS 7220

Computability and Complexity

Wright State University-Main Campus · UGRD · Fall 2026

1 section

Catalog description

Fundamentals of computability theory. Undecidability. Time and space complexity. Cook’s Theorem and NP completeness. Approximation strategies for intractable problems. Department Managed Prerequisite(s): Undergraduate level CS 3200 Minimum Grade of D or Graduate level CS 5200 Minimum Grade of D

Sections

Current meeting, instructor, credit, and enrollment details

Updated 2 hours ago

001

Availability not recently verified

Class #wright_main_campus-CS7220Fall 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?