Rajendra Kumar retweeted
WOW!! 🤯
Among many jaw-dropping results, this proves NP-hardness of the Closest Vector and Nearest Codeword Problems for *polynomial* approximation factors, for the first time ever, and via a totally new approach (Reed-Solomon techniques). Amazing!
yes, nonsofic groups exist: this statement is one of many new beautiful results proved by Astra, our next major model.
We're releasing 10 such Astra proofs, complete with lean certificates and CoT walkthroughs for each of them. The results are wide-ranging, from von Neumann algebras (disproof of Connes' Rigidity Conjecture) to better bounds for high dimensional sphere packing, for circuit complexity, for monochromatic triangles in multicolored graphs, and more.
More thoughts here: openai.com/index/ten-advance…
Rajendra Kumar retweeted
Friends, the list of newly elected Fellows of The Royal Society for the year 2026 is *finally* public.
Prof. @agrawalmanindra is now Manindra Agrawal FRS.
Hearty congratulations to Manindra for this well-deserved recognition, to go along with so many others that he has had.👏👏
Rajendra Kumar retweeted
📢 Applications are now open for the position of Institute Postdoctoral Fellow (IPDF) in all areas of Computer Science.
🗓 Deadline: 15 April, 5:30 PM IST
🔗 More details: home.iitd.ac.in/jobs-iitd/up…
#Postdoc #ComputerScience #IITDelhi #ResearchCareers
Rajendra Kumar retweeted
🎓 PhD Admissions — Winter Cycle
Interested in pursuing a Ph.D. in Computer Science at one of India’s top institutes @iitdelhi ?
📢 CSE, IIT Delhi invites passionate researchers to join our Ph.D. program!
Explore cutting-edge areas in AI, quantum computing, systems, security, theoretical CS, and trustworthy AI.
🗓️ Written test: Dec 3 | Interviews: Dec 4–5
🔗 Apply: home.iitd.ac.in/pg-admission…
📘 Details: homecse.iitd.ac.in/phd-admis…
Rajendra Kumar retweeted
Interested in learning about fundamental and cutting-edge research on data privacy?
Check out the summer school and workshop on "Computational Challenges in Data Privacy" at IIT Delhi from July 5-8, 2025.
rohitvaish.in/Events/Privacy…
Register by May 31st!
forms.gle/YWBbNEVVgu71HQLC7
Rajendra Kumar retweeted
Job Alert 📩
Interested in exploring post-quantum cryptography?
Join Prof. Rajendra Kumar (@Kumar__Rajendra) and Prof. Vireshwar Kumar (@kvireshwar)'s group!
Check out the detailed advertisement and apply soon!!
owncloud.iitd.ac.in/nextclou…
Rajendra Kumar retweeted
CSE IITD is now officially on X! 🎓 Follow us for updates on research, events, faculty achievements, and academic opportunities. Stay tuned for exciting insights from our department! #CSEIITD
Rajendra Kumar retweeted
Along with Amir Abboud and Nick Fischer, I'm organizing a tutorial in Fine-grained complexity in July 2024, primarily for graduate students. The website to apply is: dimacs.rutgers.edu/events/de….
Rajendra Kumar retweeted
I'm looking to hire one or two Ph.D. students for Fall '24 to work on problems related to lattices, error-correcting codes, and theoretical CS more broadly. If you're interested, please apply to Colorado *this fall*! Deadline: 12/15/2023, link: colorado.edu/cs/admissions/g… 2/
Rajendra Kumar retweeted
FOCS 23 list of accepted papers is online: web.cs.ucla.edu/~sahai/focs2…
Super excited to share that our paper on "Why we couldn't prove SETH hardness of the Closest Vector Problem for even norms" has been accepted to FOCS'23. Joint work with @diveshaggarwal . Refer to @huckbennett 's tweet for an insightful description of this result.
Replying to @diveshaggarwal
@diveshaggarwal and @Kumar__Rajendra just posted a new paper that I'm very excited about: arxiv.org/abs/2211.04385. It addresses a problem that my coauthors and I spent 5 years working on without success: showing fine-grained hardness of SVP and CVP in the l_2 norm under SETH. 1/4
Excited to announce that I am on the academic job market this year. Please reach out with opportunities!
My research focuses on the foundations of Post-Quantum Cryptography. For more details, check out: sites.google.com/view/rajend…
(RTs are appreciated)
Really excited about our new paper on the Lattice Problems Beyond Polynomial Time. Check out this excellent thread by @NoahSD .
Super excited about this new paper (with MANY awesome co-authors): Lattice Problems Beyond Polynomial Time arxiv.org/abs/2211.11693 .
We revisit four foundational results in the complexity of lattice problems and show how to generalize them, well, beyond polynomial time.
Rajendra Kumar retweeted
Why we couldn't prove SETH hardness of the Closest Vector Problem for even norms, and of the Subset Sum Problem! ift.tt/gJWoXbk
Rajendra Kumar retweeted
As we prepare for the possible assault of a future quantum computer, NIST has chosen the first group of tools for our post-quantum cryptographic standard:
🔒 CRYSTALS-Kyber
🔒 CRYSTALS-Dilithium
🔒 FALCON
🔒 Sphincs+
Learn more: nist.gov/news-events/news/20…
Rajendra Kumar retweeted
Congratulations to
Zvika Brakerski, Craig Gentry, and Vinod Vaikuntanathan,
winners of the 2022 Gödel prize. sigact.org/prizes/g%C3%B6del…
Rajendra Kumar retweeted
A thread on the Integer Programming Problem (IP), based on notes for my class: web.engr.oregonstate.edu/~be….
Highlights of notes:
1. Slightly modified Lenstra's algorithm with improved runtime.
2. Kannan's algorithm, which is faster yet, and not in other lattice notes AFAIK. 1/
Rajendra Kumar retweeted
What is the meaning of life?
Hear 2021 chemistry laureate Benjamin List answer the question we all are trying to find an answer to.
#NobelPrize
Benjamin List on the meaning of life
Rajendra Kumar retweeted
Delighted to announce the establishment of a Quantum Research Park at @iiscbangalore seed funded by the #Karnataka Innovation and Technology Society. This initiative will be a game changer in the Quantum-related research and entrepreneurial ecosystem in the state. @IIScQuanTech



















