Conversation

This Tweet was deleted by the Tweet author. Learn more

I used to joke that since most homework/exam problems are in NP, we should just treat them as PCPs and check a constant number of bits. I stopped joking about it because a more junior TA appeared to take it seriously.

2:25 AM · Dec 15, 2021Twitter Web App

This Tweet was deleted by the Tweet author. Learn more

Nicholas Schiefer

@nschiefer

Dec 15, 2021

I think that spot-grading makes a lot of sense, but I've definitely always needed to check a super-constant-in-submission-length number of places (and also not randomly sampled). Apparently I am not able to capture the full power of the PCP theorem. Kudos to those who can!