Complexity Theory - Gonit Sora

Gonit Sora

Sign in Subscribe

Complexity Theory

A collection of 2 posts

The charm in proving something is impossible: a complexity theoretic view

Complexity Theory

The charm in proving something is impossible: a complexity theoretic view

Dr. Nutan Limaye (IIT Bombay) gave a talk in the webinar series by Gonit Sora on 6th September 2020. She spoke about complexity theory. The full video of the talk is available in our YouTube channel as well as below. To register for the upcoming events, please submit the form

P v/s NP Problem

P v/s NP Problem

[Editor’s Note: This is the next part in our series on the Millennium Problems.] This is a problem in the area of computational complexity which deals with efficiency of algorithms. An alphabet A is a finite nonempty set of symbols and a computational problem over A is simply a