Deepanshu Kush

MaRDI QIDQ2034077zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Near neighbor search via efficient average distortion embeddings	2026-04-27	Paper
Lower bounds for set-multilinear branching programs	2026-01-28	Paper
Tree-depth and the formula complexity of subgraph isomorphism	2025-08-12	Paper
Near-optimal set-multilinear formula lower bounds	2024-11-19	Paper
Improved low-depth set-multilinear circuit lower bounds	2024-07-05	Paper
Tree-Depth and the Formula Complexity of Subgraph Isomorphism SIAM Journal on Computing	2023-04-04	Paper
A \#SAT algorithm for small constant-depth circuits with PTF gates (available as arXiv preprint)	2022-07-18	Paper
A \#SAT algorithm for small constant-depth circuits with PTF gates Algorithmica	2022-03-22	Paper
The normalized matching property in random and pseudorandom bipartite graphs The Electronic Journal of Combinatorics	2021-06-21	Paper
Near Neighbor Search via Efficient Average Distortion Embeddings	2021-05-10	Paper
Tree-depth and the Formula Complexity of Subgraph Isomorphism (available as arXiv preprint)	2020-04-28	Paper

Research outcomes over time

This page was built for person: Deepanshu Kush