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
 

Contact us

P Santhi Thilagam
Associate Professor and Head
Department of CSE, NITK, Surathkal
P. O. Srinivasnagar, Mangalore - 575 025
Karnataka, India.

  • Hot line: +91-0824-2474060

Connect with us

We're on Social Networks. Follow us & get in touch.