Arkadev Chattopadhyay

From MaRDI portal
Person:2229710

Available identifiers

zbMath Open chattopadhyay.arkadevMaRDI QIDQ2229710

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61262702024-04-09Paper
https://portal.mardi4nfdi.de/entity/Q61870262024-02-05Paper
Lower bounds for monotone arithmetic circuits via communication complexity2023-11-14Paper
Equality alone does not simulate randomness2022-07-27Paper
Query-To-Communication Lifting for BPP Using Inner Product2022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50924832022-07-21Paper
A Short List of Equalities Induces Large Sign-Rank2022-07-08Paper
https://portal.mardi4nfdi.de/entity/Q49883002021-05-14Paper
Query-to-Communication Lifting Using Low-Discrepancy Gadgets2021-03-24Paper
Computing the multilinear factors of lacunary polynomials without heights2021-02-18Paper
A Lifting Theorem with Applications to Symmetric Functions2020-11-25Paper
The Log-Approximate-Rank Conjecture Is False2020-11-11Paper
The log-approximate-rank conjecture is false2020-01-30Paper
Simulation theorems via pseudo-random properties2019-12-19Paper
Simulation beats richness: new data-structure lower bounds2019-08-22Paper
https://portal.mardi4nfdi.de/entity/Q57434252019-05-10Paper
https://portal.mardi4nfdi.de/entity/Q46124862019-01-31Paper
Tight Network Topology Dependent Bounds on Rounds of Communication2018-07-16Paper
Lower Bounds for Elimination via Weak Regularity2018-04-19Paper
https://portal.mardi4nfdi.de/entity/Q29696482017-03-22Paper
Factoring bivariate lacunary polynomials without heights2017-02-10Paper
https://portal.mardi4nfdi.de/entity/Q29549982017-01-24Paper
Upper and Lower Bounds on the Power of Advice2016-08-26Paper
https://portal.mardi4nfdi.de/entity/Q31871792016-08-16Paper
The Range of Topological Effects on Communication2015-11-04Paper
Graph Isomorphism is Not AC0-Reducible to Group Isomorphism2015-09-24Paper
The Hardness of Being Private2015-09-07Paper
Learning read-constant polynomials of constant degree modulo composites2015-02-05Paper
Linear Systems over Composite Moduli2014-07-25Paper
Graph Isomorphism is not AC 0 reducible to Group Isomorphism2012-08-29Paper
Learning Read-Constant Polynomials of Constant Degree Modulo Composites2011-06-17Paper
https://portal.mardi4nfdi.de/entity/Q35681062010-06-17Paper
Properly 2-Colouring Linear Hypergraphs2009-02-17Paper
Languages with Bounded Multiparty Communication Complexity2007-09-03Paper
Automata, Languages and Programming2006-01-10Paper
https://portal.mardi4nfdi.de/entity/Q44492352004-02-08Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Arkadev Chattopadhyay