Chandrima Kayal

According to our database, Chandrima Kayal authored at least 8 papers between 2022 and 2024.

Collaborative distances:

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

2024

Relations between monotone complexity measures based on decision tree complexity.

Farzan Byramji, Vatsal Jha, Chandrima Kayal, Rajat Mittal

Electron. Colloquium Comput. Complex., 2024

About almost covering subsets of the hypercube.

Arijit Ghosh, Chandrima Kayal, Soumi Nandi

CoRR, 2024

Approximate Degree Composition for Recursive Functions.

Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Nitin Saurabh

Proceedings of the Approximation, 2024

2023

Covering almost all the layers of the hypercube with multiplicities.

Arijit Ghosh, Chandrima Kayal, Soumi Nandi

Discret. Math., July, 2023

Separations between Combinatorial Measures for Transitive Functions.

Sourav Chakraborty, Chandrima Kayal, Manaswi Paraashar

Electron. Colloquium Comput. Complex., 2023

On the Composition of Randomized Query Complexity and Approximate Degree.

Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh

Electron. Colloquium Comput. Complex., 2023

Linear isomorphism testing of Boolean functions with small approximate spectral norm.

Arijit Ghosh, Chandrima Kayal, Manaswi Paraashar, Manmatha Roy

CoRR, 2023

2022

An optimal generalization of Alon and Füredi's covering result.

Arijit Ghosh, Chandrima Kayal, Soumi Nandi

CoRR, 2022