2 citations · 2 across the 10 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
quant-ph2026
Optimal compression with quantum retrieval
Shyam Dhamapurkar, Mohit Garg, Manaswi Paraashar +1
We consider the following data compression problem. Given a string of Hamming weight at most , compress it into a shorter string so that any…
cs.CC2026
Bounds for Hardness Condensation in the Query Model
Chandrima Kayal, Rajat Mittal, Sai Soumya Nalli +4
For any Boolean function with a complexity measure having value , is it possible to restrict the function to variables while keeping t…
cs.DS2026
Spectral Shadows: When Communication Complexity Meets Linear Invariance Testing
Swarnalipa Datta, Arijit Ghosh, Chandrima Kayal +2
In this short note, we initiate the study of the Linear Isomorphism Testing Problem in the setting of communication complexity, a natural linear algebraic generalization of the cla…