- Department of Computer Science
- Vision, Mission, & Values
- Degrees & Programs
- Courses
- First Year Transfer Students
- Current Students
- Prospective Students
- Faculty & Staff
- Professors Emeritus
- Industrial Advisory Board
- Financial Assistance
- Employment Opportunities
- Donate
- Graduate Capstone
- Careers for Majors
- Resources
- Contact Us
- Help for Students
Complexity
Section 3b: Complexity
- Turing Machines and Decidability
- Deciable, Acceptable and Co-Acceptable Languages
- Turing-Completeness
- Reducibility
- The Halthing Problem and Undecidable Problems
- Complexity Classes
- Polynomial Reducibility
- Time Complexity: P, NP, coNP and EXPTIME
- NP-Completeness and NP-Complete Problems