Chandrima Kayal

20 papers A* 1A 4Journal 14Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
Hardness Condensation for Decision Tree Measures by Restrictions.
CoRR
Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Nitin Saurabh
2026 A conf
Spectral Norm, Economical Sieve, and Linear Invariance Testing of Boolean Functions.
STACS
Swarnalipa Datta, Arijit Ghosh, Chandrima Kayal, Manaswi Paraashar, Manmatha Roy
2026 J jnl
Spectral Shadows: When Communication Complexity Meets Linear Invariance Testing.
CoRR
Swarnalipa Datta, Arijit Ghosh, Chandrima Kayal, Manaswi Paraashar, Manmatha Roy
2025 A conf
Testing Isomorphism of Boolean Functions over Finite Abelian Groups.
APPROX/RANDOM
Swarnalipa Datta, Arijit Ghosh, Chandrima Kayal, Manaswi Paraashar, Manmatha Roy
2025 J jnl
Testing Isomorphism of Boolean Functions over Finite Abelian Groups.
CoRR
Swarnalipa Datta, Arijit Ghosh, Chandrima Kayal, Manaswi Paraashar, Manmatha Roy
2024 J jnl
About almost covering subsets of the hypercube.
CoRR
Arijit Ghosh, Chandrima Kayal, Soumi Nandi
2024 A conf
Approximate Degree Composition for Recursive Functions.
APPROX/RANDOM
Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Nitin Saurabh
2024 J jnl
Approximate Degree Composition for Recursive Functions.
CoRR
Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Nitin Saurabh
2024 — conf
Relations Between Monotone Complexity Measures Based on Decision Tree Complexity.
COCOON (1)
Farzan Byramji, Vatsal Jha, Chandrima Kayal, Rajat Mittal
2024 J jnl
Relations between monotone complexity measures based on decision tree complexity.
CoRR
Farzan Byramji, Vatsal Jha, Chandrima Kayal, Rajat Mittal
2024 J jnl
Relations between monotone complexity measures based on decision tree complexity.
Electron. Colloquium Comput. Complex.
Farzan Byramji, Vatsal Jha, Chandrima Kayal, Rajat Mittal
2023 J jnl
Covering almost all the layers of the hypercube with multiplicities.
Discret. Math.
Arijit Ghosh, Chandrima Kayal, Soumi Nandi
2023 J jnl
Linear isomorphism testing of Boolean functions with small approximate spectral norm.
CoRR
Arijit Ghosh, Chandrima Kayal, Manaswi Paraashar, Manmatha Roy
2023 A conf
On the Composition of Randomized Query Complexity and Approximate Degree.
APPROX/RANDOM
Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh
2023 J jnl
On the Composition of Randomized Query Complexity and Approximate Degree.
CoRR
Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh
2023 J jnl
On the Composition of Randomized Query Complexity and Approximate Degree.
Electron. Colloquium Comput. Complex.
Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh
2023 J jnl
Separations between Combinatorial Measures for Transitive Functions.
Electron. Colloquium Comput. Complex.
Sourav Chakraborty, Chandrima Kayal, Manaswi Paraashar
2022 J jnl
An optimal generalization of Alon and Füredi's covering result.
CoRR
Arijit Ghosh, Chandrima Kayal, Soumi Nandi
2022 A* conf
Separations Between Combinatorial Measures for Transitive Functions.
ICALP
Sourav Chakraborty, Chandrima Kayal, Manaswi Paraashar
2021 J jnl
Separations between Combinatorial Measures for Transitive Functions.
CoRR
Sourav Chakraborty, Chandrima Kayal, Manaswi Paraashar