A Short List of Equalities Induces Large Sign Rank
Chattopadhyay, Arkadev, Mande, Nikhil
Published in 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) (01.10.2018)
Published in 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) (01.10.2018)
Get full text
Conference Proceeding
Simulation Theorems via Pseudo-random Properties
Chattopadhyay, Arkadev, Koucký, Michal, Loff, Bruno, Mukhopadhyay, Sagnik
Published in Computational complexity (01.12.2019)
Published in Computational complexity (01.12.2019)
Get full text
Journal Article
Computing the multilinear factors of lacunary polynomials without heights
Chattopadhyay, Arkadev, Grenet, Bruno, Koiran, Pascal, Portier, Natacha, Strozecki, Yann
Published in Journal of symbolic computation (01.05.2021)
Published in Journal of symbolic computation (01.05.2021)
Get full text
Journal Article
The NOF Multiparty Communication Complexity of Composed Functions
Ada, Anil, Chattopadhyay, Arkadev, Fawzi, Omar, Nguyen, Phuong
Published in Computational complexity (01.09.2015)
Published in Computational complexity (01.09.2015)
Get full text
Journal Article
Learning Read-Constant Polynomials of Constant Degree Modulo Composites
Chattopadhyay, Arkadev, Gavaldà, Ricard, Hansen, Kristoffer Arnsfelt, Thérien, Denis
Published in Theory of computing systems (01.08.2014)
Published in Theory of computing systems (01.08.2014)
Get full text
Journal Article
Publication
Lifting to Parity Decision Trees Via Stifling
Chattopadhyay, Arkadev, Mande, Nikhil S, Sanyal, Swagato, Sherif, Suhail
Published in arXiv.org (30.11.2022)
Published in arXiv.org (30.11.2022)
Get full text
Paper
Journal Article
Linear Systems over Finite Abelian Groups
Chattopadhyay, A., Lovett, S.
Published in 2011 IEEE 26th Annual Conference on Computational Complexity (01.06.2011)
Published in 2011 IEEE 26th Annual Conference on Computational Complexity (01.06.2011)
Get full text
Conference Proceeding
Lower Bounds for Circuits with Few Modular and Symmetric Gates
Chattopadhyay, Arkadev, Hansen, Kristoffer Arnsfelt
Published in Automata, Languages and Programming (2005)
Published in Automata, Languages and Programming (2005)
Get full text
Book Chapter
Conference Proceeding
Monotone Complexity of Spanning Tree Polynomial Re-visited
Chattopadhyay, Arkadev, Datta, Rajit, Ghosal, Utsab, Mukhopadhyay, Partha
Year of Publication 14.09.2021
Year of Publication 14.09.2021
Get full text
Journal Article
Topology Matters in Communication
Chattopadhyay, Arkadev, Radhakrishnan, Jaikumar, Rudra, Atri
Published in 2014 IEEE 55th Annual Symposium on Foundations of Computer Science (01.10.2014)
Published in 2014 IEEE 55th Annual Symposium on Foundations of Computer Science (01.10.2014)
Get full text
Conference Proceeding
The Hardness of Being Private
Ada, A., Chattopadhyay, A., Cook, S., Fontes, L., Koucky, M., Pitassi, T.
Published in 2012 IEEE 27th Conference on Computational Complexity (01.06.2012)
Published in 2012 IEEE 27th Conference on Computational Complexity (01.06.2012)
Get full text
Conference Proceeding