CK
Chandrima Kayal
cs.CCcs.DMcs.DSmath.COquant-ph
On Valency
published · living versionsW_5u3wmuhv·v1 · currentpublished
Quantum Query Lower Bounds from Classical Moment Matching
with Frédéric Magniez, Sayantan Sen, Dániel Szabó
1 version
W_atmzacmq·v1published
Preprints & journals
14 papers in the corpus · 2021–2026Constructive Arithmetic Regularity for Abelian Groups2610.26368v1 · Swarnalipa Datta, Arijit Ghosh, Chandrima Kayal et al.2026 · 0 citationsarXivon Valency
Near-optimal quantum query lower bounds on bipartiteness and expansion testing in the bounded-degree graph model2610.01752v1 · Chandrima Kayal, Sayantan Sen, D'aniel Szab'o2026 · 0 citationsarXiv
Certification complexity of Boolean functions2609.26757v1 · Chandrima Kayal, Sophie Laplante, 'Emile Larroque et al.2026 · 0 citationsarXiv
Bounds for Hardness Condensation in the Query Model2602.00754v2 · Chandrima Kayal, Rajat Mittal, Sai Soumya Nalli et al.2026 · 0 citationsarXiv
Spectral Shadows: When Communication Complexity Meets Linear Invariance Testing2601.06828v1 · Swarnalipa Datta, Arijit Ghosh, Chandrima Kayal et al.2026 · 0 citationsarXiv
Testing Isomorphism of Boolean Functions over Finite Abelian Groups2507.07654v1 · Swarnalipa Datta, Arijit Ghosh, Chandrima Kayal et al.2025 · 0 citationsarXiv
About almost covering subsets of the hypercube2409.10573v4 · Arijit Ghosh, Chandrima Kayal, Soumi Nandi2024 · 0 citationsarXiv
Approximate Degree Composition for Recursive Functions2407.08385v2 · Sourav Chakraborty, Chandrima Kayal, Rajat Mittal et al.2024 · 0 citationsarXiv
Relations between monotone complexity measures based on decision tree complexity2406.07859v2 · Farzan Byramji, Vatsal Jha, Chandrima Kayal et al.2024 · 0 citationsarXiv
Spectral Norm, Economical Sieve, and Linear Invariance Testing of Boolean Functions2308.02662v2 · Swarnalipa Datta, Arijit Ghosh, Chandrima Kayal et al.2023 · 0 citationsarXiv
On higher multiplicity hyperplane and polynomial covers for symmetry preserving subsets of the hypercube2307.16881v1 · Arijit Ghosh, Chandrima Kayal, Soumi Nandi et al.2023 · 0 citationsarXiv
On the Composition of Randomized Query Complexity and Approximate Degree2307.03900v2 · Sourav Chakraborty, Chandrima Kayal, Rajat Mittal et al.2023 · 0 citationsarXiv
Almost covering all the layers of hypercube with multiplicities2207.13752v3 · Arijit Ghosh, Chandrima Kayal, Soumi Nandi2022 · 0 citationsarXiv
Separations between Combinatorial Measures for Transitive Functions2103.12355v7 · Sourav Chakraborty, Chandrima Kayal, Manaswi Paraashar2021 · 2 citationsDiscrete Mathematics & Theoretical Computer Science, vol. 27:2, Discrete Algorithms (September 20, 2025) dmtcs:11133
Career total: 16 works. 14 are in this corpus.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.