Deepanshu Kush

According to our database, Deepanshu Kush authored at least 8 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Lower Bounds for Set-Multilinear Branching Programs.

Prerona Chatterjee, Deepanshu Kush, Shubhangi Saraf, Amir Shpilka

Proceedings of the 39th Computational Complexity Conference, 2024

2023

Tree-Depth and the Formula Complexity of Subgraph Isomorphism.

Deepanshu Kush, Benjamin Rossman

SIAM J. Comput., February, 2023

Near-Optimal Set-Multilinear Formula Lower Bounds.

Deepanshu Kush, Shubhangi Saraf

Electron. Colloquium Comput. Complex., 2023

Exponential Lower Bounds Against Sums of ROABPs.

Prerona Chatterjee, Deepanshu Kush, Shubhangi Saraf, Amir Shpilka

Electron. Colloquium Comput. Complex., 2023

2022

Improved Low-Depth Set-Multilinear Circuit Lower Bounds.

Deepanshu Kush, Shubhangi Saraf

Electron. Colloquium Comput. Complex., 2022

2021

The Normalized Matching Property in Random and Pseudorandom Bipartite Graphs.

Niranjan Balachandran, Deepanshu Kush

Electron. J. Comb., 2021

Near Neighbor Search via Efficient Average Distortion Embeddings.

Deepanshu Kush, Aleksandar Nikolov, Haohua Tang

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2018

A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates.

Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan

Electron. Colloquium Comput. Complex., 2018