Apr 16, 2024  
2018-2019 Florida Tech Catalog 
    
2018-2019 Florida Tech Catalog [ARCHIVED CATALOG]

Add to Personal Catalog (opens a new window)

CSE 5610 Computational Complexity

Credit Hours: 3
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  



Add to Personal Catalog (opens a new window)