Follow
Arkadev Chattopadhyay
Title
Cited by
Cited by
Year
Multiparty communication complexity of disjointness
A Chattopadhyay, A Ada
arXiv preprint arXiv:0801.3624, 2008
1022008
On the representational efficiency of restricted boltzmann machines
J Martens, A Chattopadhya, T Pitassi, R Zemel
Advances in Neural Information Processing Systems 26, 2013
762013
Discrepancy and the power of bottom fan-in in depth-three circuits
A Chattopadhyay
48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 449-458, 2007
632007
The story of set disjointness
A Chattopadhyay, T Pitassi
ACM SIGACT News 41 (3), 59-85, 2010
622010
Topology matters in communication
A Chattopadhyay, J Radhakrishnan, A Rudra
2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 631-640, 2014
362014
Simulation theorems via pseudo-random properties
A Chattopadhyay, M Koucký, B Loff, S Mukhopadhyay
computational complexity 28 (4), 617-659, 2019
322019
The log-approximate-rank conjecture is false
A Chattopadhyay, NS Mande, S Sherif
Journal of the ACM (JACM) 67 (4), 1-28, 2020
282020
Lower bounds for circuits with MOD_m gates
A Chattopadhyay, N Goyal, P Pudlák, D Thérien
2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06 …, 2006
282006
Circuits, Communication and Polynomials
A Chattopadhyay
252008
The hardness of being private
A Ada, A Chattopadhyay, SA Cook, L Fontes, M Koucký, T Pitassi
ACM Transactions on Computation Theory (TOCT) 6 (1), 1-24, 2014
242014
Simulation beats richness: New data-structure lower bounds
A Chattopadhyay, M Koucký, B Loff, S Mukhopadhyay
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
192018
The NOF multiparty communication complexity of composed functions
A Ada, A Chattopadhyay, O Fawzi, P Nguyen
computational complexity 24 (3), 645-694, 2015
192015
Graph isomorphism is not AC0-reducible to group isomorphism
A Chattopadhyay, J Torán, F Wagner
ACM Transactions on Computation Theory (TOCT) 5 (4), 1-13, 2013
192013
Linear systems over composite moduli
A Chattopadhyay, A Wigderson
2009 50th Annual IEEE Symposium on Foundations of Computer Science, 43-52, 2009
182009
Lower bounds for circuits with few modular and symmetric gates
A Chattopadhyay, KA Hansen
International Colloquium on Automata, Languages, and Programming, 994-1005, 2005
172005
Query-to-communication lifting for BPP using inner product
A Chattopadhyay, Y Filmus, S Koroth, O Meir, T Pitassi
46th International Colloquium on Automata, Languages, and Programming (ICALP …, 2019
152019
Lower bounds on interactive compressibility by constant-depth circuits
A Chattopadhyay, R Santhanam
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 619-628, 2012
152012
Query-to-communication lifting using low-discrepancy gadgets
A Chattopadhyay, Y Filmus, S Koroth, O Meir, T Pitassi
SIAM Journal on Computing 50 (1), 171-210, 2021
142021
A short list of equalities induces large sign rank
A Chattopadhyay, N Mande
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), 47-58, 2018
142018
A little advice can be very helpful
A Chattopadhyay, J Edmonds, F Ellen, T Pitassi
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
142012
The system can't perform the operation now. Try again later.
Articles 1–20