A new paper with Rahul Santhanam @rahulsanthanam and Zhikun Wang @zhikun_!
https://t.co/oRPTeybXjw
In this paper, we study the 𝒓𝒂𝒏𝒈𝒆 𝒂𝒗𝒐𝒊𝒅𝒂𝒏𝒄𝒆 problem: Given a circuit C : {0, 1}^n -> {0, 1}^ℓ (ℓ > n), find some y in {0, 1}^ℓ that is not in the range of C. (1/8)
CCC (Computational Complexity Conference) is happening next week. Registration is FREE for everyone with no papers in the conference (like me 🥲) https://t.co/TDJnAVvFI1
Oxford-Warwick Complexity Seminar (Thursday at 1pm London): Shuichi Hirahara (NII Tokyo) will tell us how meta-complexity reveals a deep connection between average-case complexity and worst-case hardness for problems in NP.
https://t.co/AvChjUu960
Oxford-Warwick Complexity Seminar (Friday at 5pm London): Avishay Tal (Berkeley) will tell us about pseudorandomness for read-once monotone branching programs and its connection to the problem of derandomizing space-bounded computations.
Info: https://t.co/AvChjUu960
I was rejected from EVERY grad school I applied to. (I applied to almost all of the usual places.) Funnily, I was awarded an NSF fellowship. I HAD AN NSF FELLOWSHIP, BUT NO PHD PROGRAM TO GO TO. Luckily, Cornell let me use it for an MEng, and I used that to write up a SODA paper. https://t.co/NS98cvsVbf
Related to this: If you're interested in CS theory and you like watching a professor openly discuss his failures, I have got a talk for you! https://t.co/7yPw8k8jUN
@ben_golub This is a graph I showed admitted grad students in the last visit day. The point was that they will never have as much confidence as they do right now, but with time they will regain ~75% of it back.
Woohoo! My team, chachachejiang, came in 4th place overall in the #HashCode Online Qualifications . Our final score was 10519244. 🏆 https://t.co/nLyVDq55e4
(吉老师牛逼