Abstract: In the sparse polynomial multiplication problem, one is asked to multiply two sparse polynomials f and g in time that is proportional to the size of the input plus the size of the output.

Students can plan their studies for board exam preparation with the official CBSE Class 12 Applied Maths syllabus (2026-27).

Abstract: The Multi-Key Fully Homomorphic Encryption (MKFHE) based on the NTRU cryptosystem is an important alternative to the post-quantum cryptography due to its simple scheme form, high efficiency, ...

Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills ...

COLT, Learning Two Layer Rectified Neural Networks in Polynomial Time with Ainesh Bakshi and Rajesh Jayaram Full version on arXiv COLT, Faster Algorithms for High Dimensional Robust Covariance ...

Santanu Das, Sagnik Chatterjee, Jatin Batra Learning to Perturb Hidden Representations for Generalizable Deep Learning Hua Li Realistic honeypot evaluations for scheming propensity Victoria Krakovna, ...