Computational Complexity
Course Name:
Computational Complexity (CO465)
Programme:
B.Tech (CSE)
Category:
Programme Specific Electives (PSE)
Credits (L-T-P):
03 (3-0-0)
Content:
Problems and algorithms- classification of problems, Decision, Search, Optimization and enumeration problems, Parallel models and complexity, Function(search) problems, One way functions- public key cryptography.
References:
1. Papadimitirou C. H., "Computational Complexity", Addison Wesley, 2003.
Department:
Computer Science and Engineering