CSCE 424/824: Computational Complexity Theory

Prereqs: CSCE 235; CSCE 310 or CSCE 311.
Turing machine model of computation: deterministic, nondeterministic, alternating, probabilistic. Complexity classes: Time and space bounded, deterministic, nondeterministic, probabilistic. Reductions and completeness. Complexity of counting problems. Non-uniformity. Lower bounds. Interactive proofs.
Credit Hours: 3
Course Format: Lecture 3
Course Delivery: Classroom

Attention

This is the site for old bulletin data. Please head to UNL's Course Catalog for updated course and program information.