The following pages link to Arkadev Chattopadhyay (Q2229710):
Displaying 22 items.
- Computing the multilinear factors of lacunary polynomials without heights (Q2229711) (← links)
- Learning read-constant polynomials of constant degree modulo composites (Q2254504) (← links)
- Simulation theorems via pseudo-random properties (Q2281252) (← links)
- Upper and Lower Bounds on the Power of Advice (Q2816830) (← links)
- Graph Isomorphism is not AC 0 reducible to Group Isomorphism (Q2908861) (← links)
- The Hardness of Being Private (Q2943893) (← links)
- Graph Isomorphism is Not AC0-Reducible to Group Isomorphism (Q2947584) (← links)
- (Q2954998) (← links)
- Factoring bivariate lacunary polynomials without heights (Q2963227) (← links)
- (Q2969648) (← links)
- Learning Read-Constant Polynomials of Constant Degree Modulo Composites (Q3007614) (← links)
- (Q3187179) (← links)
- (Q4612486) (← links)
- Lower Bounds for Elimination via Weak Regularity (Q4636619) (← links)
- (Q4988300) (← links)
- Query-To-Communication Lifting for BPP Using Inner Product (Q5091185) (← links)
- Equality alone does not simulate randomness (Q5091765) (← links)
- (Q5092483) (← links)
- A Lifting Theorem with Applications to Symmetric Functions (Q5136315) (← links)
- (Q6126270) (← links)
- (Q6187026) (← links)
- Symmetry and quantum query-to-communication simulation (Q6490969) (← links)
