CSE 5610

Computational Complexity

Florida Institute of Technology · UGRD · Fall 2026

1 section

Catalog description

Reviews problems, algorithms, Turing machines and computability. Studies Boolean and first-order logic, leading to undecidability results; and relations among complexity classes using reductions and completeness. Presents approximate and randomized algorithms. Prerequisite: CSE 5210 and CSE 5211

Sections

Current meeting, instructor, credit, and enrollment details

Updated 10 hours ago

001

Availability not recently verified

Class #florida_online-1105Fall 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?