Gonit Sora
  • Home
  • About
  • Mentoring
  • Webinars
  • Submissions
  • Assamese
Sign in Subscribe

Theoretical Computer Science

A collection of 2 posts
2021 Abel Prize

Laszlo Lovasz and Avi Wigderson share the 2021 Abel Prize

Last time the phrase “theoretical computer science” found mention in an Abel Prize citation was in 2012 when the legendary Hungarian mathematician, Endre Szemerédi was awarded mathematics’ highest honour. During the ceremony, László Lovász and Avi Wigderson were there to offer a primer into the majestic contributions of the laureate.
Mar 21, 2021 5 min read
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
Sep 6, 2020
Page 1 of 1
Gonit Sora © 2025
  • Terms of Service
  • Privacy Policy
  • Cookie Policy
Powered by Ghost