Search Results

CSEĀ 5314. COMPUTATIONAL COMPLEXITY. 3 Hours.

Sequential and parallel complexity classes (e.g., NP-complete and P-complete) and representative problems in languages, logic and graphs. Reduction techniques. Approximate solutions. Complexity hierarchies.