How Hard Is It To Solve?

Speaker:  Sundar Vedantham – Allentown, PA, United States
Topic(s):  Computational Theory, Algorithms and Mathematics

Abstract

This talk introduces problem complexity theory in an easily relatable way and discusses possible solution avenues. It starts from simple problems like addition/multiplication and builds up to much more complicated problems, to help analyze how the difficulty of solving them should be understood. We will discuss various classes of problem classification based on the time/space requirements needed to solve them, theoretical models used in such analysis and available recourses when the complexity involved in solving a problem is too high.

About this Lecture

Number of Slides:  25
Duration:  70 minutes
Languages Available:  English
Last Updated: 

Request this Lecture

To request this particular lecture, please complete this online form.

Request a Tour

To request a tour with this speaker, please complete this online form.

All requests will be sent to ACM headquarters for review.