Radhakrishnan, Jaikumar - School of Technology and Computer Science, Tata Institute of Fundamental Research

E-print Network

FAQ • HELP • SITE MAP • CONTACT US

Powered by Explorit

Advanced Search

Radhakrishnan, Jaikumar - School of Technology and Computer Science, Tata Institute of Fundamental Research

Privacy and interaction in quantum communication complexity and a theorem about the relative entropy of quantum states
A lower bound for the bounded round quantum communication complexity of set disjointness
Deterministic Restrictions in Circuit Complexity Shiva Chaudhuri Jaikumar Radhakrishnan
The quantum communication complexity of the pointer chasing problem: the bit version
Directed Monotone Contact Networks for Threshold Functions Jaikumar Radhakrishnan K. V. Subrahmanyam
Threshold Formulas Jaikumar Radhakrishnan
Better Lower Bounds for Monotone Threshold Formulas Jaikumar Radhakrishnan
A superlinear lower bound for undirected monotone contact networks computing Tn
Improved Bounds For Covering Complete Uniform Hypergraphs Jaikumar Radhakrishnan, Department of Computer Science,
Complexity Classes Lecturer: Jaikumar Radhakrishnan Date: 7 January 1998
Lecture Notes Interactive Proof Systems