Ninad Rajgopal

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Distribution-free proofs of proximity	2026-01-28	Paper
On the structure of learnability beyond \textsf{P/poly} Computational Complexity	2025-02-25	Paper
On the structure of learnability beyond P/poly	2023-11-20	Paper
Beyond Natural Proofs: Hardness Magnification and Locality Journal of the ACM	2023-04-27	Paper
scientific article; zbMATH DE number 7650418 (Why is no real title available?) (available as arXiv preprint)	2023-02-03	Paper
Optimally Deceiving a Learning Leader in Stackelberg Games Journal of Artificial Intelligence Research	2022-02-07	Paper
Deterministically counting satisfying assignments for constant-depth circuits with parity gates, with implications for lower bounds	2021-08-04	Paper
Improved learning of \(k\)-parities Theoretical Computer Science	2020-09-17	Paper
Beyond Natural Proofs: Hardness Magnification and Locality (available as arXiv preprint)	2019-11-19	Paper
Improved learning of \(k\)-parities Lecture Notes in Computer Science	2018-10-04	Paper
Selection lemmas for various geometric objects International Journal of Computational Geometry & Applications	2016-10-26	Paper
Hitting and Piercing Rectangles Induced by a Point Set Lecture Notes in Computer Science	2013-06-11	Paper

Research outcomes over time

This page was built for person: Ninad Rajgopal