Risultati della ricerca - Mittal, Rajat

On algorithms to find p-ordering di Gulati, Aditya, Chakrabarti, Sayak, Mittal, Rajat

Testo
Testo

On query complexity measures and their relations for symmetric functions di Mittal, Rajat, Nair, Sanjay S, Patro, Sunayana

Testo
Testo

Relations between monotone complexity measures based on decision tree complexity di Byramji, Farzan, Jha, Vatsal, Kayal, Chandrima, Mittal, Rajat

Testo
Testo

Improving Zero-Shot Detection of Low Prevalence Chest Pathologies using Domain Pre-trained Language Models di Mishra, Aakash, Mittal, Rajat, Jestin, Christy, Tingos, Kostas, Rajpurkar, Pranav

Testo
Testo

Approximate Degree Composition for Recursive Functions di Chakraborty, Sourav, Kayal, Chandrima, Mittal, Rajat, Paraashar, Manaswi, Saurabh, Nitin

Testo
Testo

A Joint Learning Approach for Semi-supervised Neural Topic Modeling di Chiu, Jeffrey, Mittal, Rajat, Tumma, Neehal, Sharma, Abhishek, Doshi-Velez, Finale

Testo
Testo

GPU-Accelerated Simulations of Moving Boundary Problems and Fluid-Structure Interaction at Extreme Scales di Kumar, Sushrut, Romero, Joshua, Seo, Jung-Hee, Fatica, Massimiliano, Mittal, Rajat

Testo
Testo

Tight Chang's-lemma-type bounds for Boolean functions di Chakraborty, Sourav, Mande, Nikhil S., Mittal, Rajat, Molli, Tulasimohan, Paraashar, Manaswi, Sanyal, Swagato

Testo
Testo

Certificate Games and Consequences for the Classical Adversary Bound di Chakraborty, Sourav, Gál, Anna, Göös, Mika, Laplante, Sophie, Mittal, Rajat, Sunny, Anupa

Testo
Testo

On the Composition of Randomized Query Complexity and Approximate Degree di Chakraborty, Sourav, Kayal, Chandrima, Mittal, Rajat, Paraashar, Manaswi, Sanyal, Swagato, Saurabh, Nitin

Testo
Testo

Bounds for Hardness Condensation in the Query Model di Kayal, Chandrima, Mittal, Rajat, Nalli, Sai Soumya, Paraashar, Manaswi, Polisetty, Karthikeya, Sarma, Jayalal, Saurabh, Nitin

Testo
Testo