Vaibhav Krishan

My photo

I am currently a Postdoc at The Institute of Mathematical Sciences. Before this, I was a PhD student at the Computer Science and Engineering department of Indian Institute of Technology Bombay, where I was very fortunate to be advised by Prof. Nutan Limaye and Prof. Sundar Vishwanathan. Previously, I was an undergraduate student at the department of Computer Science and Engineering of Indian Institute of Technology Bombay.

I am broadly interested in theoretical computer science, especially complexity theory which deals with understanding what is “hard” to compute. Currently I'm mainly working on Boolean circuit complexity. Some other topics of complexity theory that I find fascinating are derandomisation, meta-complexity and quantum complexity.

[DBLP], [Google Scholar], [ECCC (IIT Bombay account), ECCC (Personal account)], [ORCID]

Contact:

  • vaibhkrishan [AT] gmail [DOT] com. (recommended)

  • vkrishan [AT] cse [DOT] iitb [DOT] ac [DOT] in.

  • vaibhkrishan [AT] iitb [DOT] ac [DOT] in.

  • vaibhkr [AT] imsc [DOT] res [DOT] in.

Publications

Towards ACC Lower Bounds using Torus Polynomials with Sundar Vishwanathan

MidBit+, Torus Polynomials and Non-classical Polynomials: Equivalences for ACC Lower Bounds

Upper Bound for Torus Polynomials

A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates with Swapnam Bajpai, Deepanshu Kush, Nutan Limaye and Srikanth Srinivasan

Isolation Lemma for Directed Reachability and NL vs. L with Nutan Limaye