#### Writes About:

#### Filter Results:

- Full text PDF available (25)

#### Publication Year

2003

2017

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

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Arkadev Chattopadhyay, Anil Ada
- Electronic Colloquium on Computational Complexity
- 2008

We obtain a lower bound of n on the k-party randomized communication complexity of the Disjointness function in the â€˜Number on the Foreheadâ€™ model of multiparty communication when k is a constant.â€¦ (More)

- Arkadev Chattopadhyay
- 48th Annual IEEE Symposium on Foundations ofâ€¦
- 2007

We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty 'number on the forehead' model. Our method is based on the notionâ€¦ (More)

This paper examines the question: What kinds of distributions can be efficiently represented by Restricted Boltzmann Machines (RBMs)? We characterize the RBMâ€™s unnormalized log-likelihood function asâ€¦ (More)

- Anil Ada, Arkadev Chattopadhyay, Stephen A. Cook, Lila Fontes, Michal KouckÃ½, Toniann Pitassi
- 2012 IEEE 27th Conference on Computationalâ€¦
- 2012

Kushilevitz [1989] initiated the study of information-theoretic privacy within the context of communication complexity. Unfortunately, it has been shown that most interesting functions are notâ€¦ (More)

- Arkadev Chattopadhyay, Navin Goyal, Pavel PudlÃ¡k, Denis ThÃ©rien
- 2006 47th Annual IEEE Symposium on Foundations ofâ€¦
- 2006

Let CCo(n)[m] be the class of circuits that have size o(n) and in which all gates are MOD[m] gates. We show that CC [m] circuits cannot compute MODq in sub-linear size when m, q > 1 are co-primeâ€¦ (More)

We consider constant depth circuits augmented with few modular, or more generally, arbitrary symmetric gates. We prove that circuits augmented with o(log n) symmetric gates must have size n n) toâ€¦ (More)

We generalize the deterministic simulation theorem of Raz and McKenzie [RM99], to any gadget which satisfies certain hitting property. We prove that inner-product and gap-Hamming satisfy thisâ€¦ (More)

- Arkadev Chattopadhyay, Markose Thomas, Abhishek Gupta
- 15th International Conference on Advancedâ€¦
- 2007

In this paper we propose a new energy aware routing protocol for mobile ad-hoc networks. Nodes in a mobile ad-hoc network operate on batteries, and hence designing energy aware protocols to maximizeâ€¦ (More)

- Arkadev Chattopadhyay, Rahul Santhanam
- 2012 IEEE 53rd Annual Symposium on Foundations ofâ€¦
- 2012

We formulate a new connection between instance compressibility [1]), where the compressor uses circuits from a class C, and correlation with circuits in C. We use this connection to prove the firstâ€¦ (More)

- Arkadev Chattopadhyay, Nikhil S. Mande
- Electronic Colloquium on Computational Complexity
- 2017

Proving super-polynomial lower bounds against depth-2 threshold circuits of the form THR â—¦THR is a well-known open problem that represents a frontier of our understanding in boolean circuitâ€¦ (More)