#### Filter Results:

- Full text PDF available (14)

#### Publication Year

2011

2017

- This year (0)
- Last 5 years (15)
- Last 10 years (21)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi
- 2013 IEEE Conference on Computational Complexity
- 2013

Agrawal and Vinay [2008], Koiran [2012], and Tavenas [2013] have recently shown that an exp (ω(√n log n)) lower bound for depth four homogeneous circuits computing the permanent with bottom layer of… (More)

- Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi
- 2013 IEEE 54th Annual Symposium on Foundations of…
- 2013

We show that, over Q, if an n-variate polynomial of degree d = n<sup>O(1)</sup> is computable by an arithmetic circuit of size s (respectively by an arithmetic branching program of size s) then it… (More)

- Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi
- Electronic Colloquium on Computational Complexity
- 2012

Agrawal and Vinay [AV08] have recently shown that an exponential lower bound for depth four homogeneous circuits with bottom layer of × gates having sublinear fanin translates to an exponential lower… (More)

One central issue in the formal design and analysis of reacti ve systems is the notion of refinementthat asks whether all behaviors of the implementation is allowed by the specification. The local… (More)

- Badih Ghazi, Pritish Kamath, Madhu Sudan
- 2016 IEEE 57th Annual Symposium on Foundations of…
- 2016

We present decidability results for a sub-class of "non-interactive" simulation problems, a well-studied class of problems in information theory. A non-interactive simulation problem is specified by… (More)

- Bernhard Haeupler, Pritish Kamath, Ameya Velingker
- APPROX-RANDOM
- 2015

We introduce the notion of one-way communication schemes with partial noiseless feedback. In this setting, Alice wishes to communicate a message to Bob by using a communication scheme that involves… (More)

- Mika Göös, Pritish Kamath, Toniann Pitassi, Thomas Watson
- Computational Complexity Conference
- 2017

We prove that the P-type query complexity (alternatively, decision list width) of any boolean function f is quadratically related to the P-type communication complexity of a lifted version of f . As… (More)

- Badih Ghazi, Pritish Kamath, Madhu Sudan
- Electronic Colloquium on Computational Complexity
- 2015

Motivated by the quest for a broader understanding of communication complexity of simple functions, we introduce the class of “permutation-invariant” functions. A partial function f : {0,1} × {0,1} →… (More)

- Mohammad Bavarian, Badih Ghazi, Elad Haramaty, Pritish Kamath, Ronald L. Rivest, Madhu Sudan
- Electronic Colloquium on Computational Complexity
- 2016

In the correlated sampling problem, two players, say Alice and Bob, are given two distributions, say P and Q respectively, over the same universe and access to shared randomness. The two players are… (More)

We investigate a model-theoretic property that generalize s th classical notion of “preservation under substructures”. We call this property p eservation under substructures modulo bounded cores ,… (More)