Office Phone: 0512-259-6210
Theoretical computer science, Complexity (Computer Science)
Computational Complexity, Quantum Computing and Semidefinite Programming.
Applications of semidefinite programming in complexity theory
Topics in linear programming
Characterization of binary constraint games; with R. Cleve; ICALP 2014 and QIP2014.
Quantum query complexity of state conversion; with T. Lee, B. Reichardt, R. Spalek and M. Szegedy; FOCS 2011 and QIP 2012.
Product theorems via semidefinite programming; with T. Lee;ICALP 2008.
CS 202, Department of Computer Science and Engineering IIT Kanpur, Kanpur 208016
Office Phone: 0512-[259 / 392 / 679]-6210 (O)
Copyright © 2020