Detailed Course Information |
Fall 2024
Nov 09, 2024 |
|
 |
||
 | Click the Schedule Type to find available offerings of the course on the Schedule of Classes. |
| CS 6505 - Computability&Algorithms |
|
Important concepts from computability theory; techniques for designing algorithms for combinatorial, algebraic, and number-theoretic problems; basic concepts such as NP-Completeness from computational complexity theory. Credit not awarded for both CS 6505 and CS 4540/6515.
3.000 Credit hours 3.000 Lecture hours Grade Basis: ALP Dept/Computer Science Department Course Attributes: Theory (CS) Restrictions: May not be enrolled in one of the following Levels: Undergraduate Semester Must be enrolled in one of the following Campuses: Georgia Tech-Atlanta * Prerequisites: Undergraduate Semester level CS 3510 Minimum Grade of D |
| Return to Previous | New Search |
|