## Pritish Kamath
I co-organize the A&C Seminar at MIT. Please contact me if you want to give a talk! ## Brief BiographyI am a graduate student at MIT. I am very fortunate to be advised by Prof. Madhu Sudan and Prof. Ronitt Rubinfeld. I also occasionally visit the Theory CS group at Harvard. I am generally enthusiastic about Theoretical Computer Science and Mathematics, and am particularly interested in various aspects of Complexity Theory and Learning Theory. Before coming to MIT, I graduated from IIT Bombay with a B. Tech in Computer Science and Engineering in 2012. After that, I spent a year at Microsoft Research India as a Research Assistant, where I had a great experience working under the guidance of Neeraj Kayal in the area of Arithmetic Complexity. ## ResumeYou can find my (rather outdated) resume here. ## Favourite Quotes‘‘ *The determinant of this conjecture will be permanently famous*’’ - Neeraj Kayal (on the*Determinant vs. Permanent*conjecture)‘‘ *How difficult could it be to find hay in a haystack?*’’ - Howard Karloff (Chap. 21, Pseudorandom constructions: expanders and extractors, Arora-Barak)‘‘ *The hardness lies within…*’’ - my own :P (refers to my long standing ambition of proving unconditional explicit hardness results)
## Visitor Flag CounterI set up this flag counter for curiosity. It shows counts since Jan 27, 2018. |