Expert Lecture on NP Complete of Algorithms

Expert Talk on “NP Complete Problem” 

By

Prof. (Dr.) Keyur Rana

Professor and & Head of the Department, Computer Engineering Department, SCET Surat

Subject : Analysis and Design of Algorithms (2150703)

 

 

Date: 19^th September, 2018                                      Venue: Seminar Hall (101), SSASIT, Surat

Topics Covered in Expert Lecture are:

• Introduction about Non Polynomial
• Requirement of Algorithms Analysis
• Types of Computational Problems
• Class of Problems (P and NP)
• Polynomial Reduction
• Travelling Salesman problem
• Hamiltonian problem

Venue: 101, Seminar Hall, SSASIT, Surat

No. of Participants: 70

Learning Outcomes:

• Enhance skills of Algorithms Design.
• Understand Various Techniques to Solve Complex Problems
• Hamiltonian Path and Cycle knowledge
• Requirement of Polynomial function in Algorithm analysis
• Different Class of Polynomial Problems