tag:blogger.com,1999:blog-3722233.post108446126606894990..comments2024-03-27T19:58:17.387-05:00Comments on Computational Complexity: Favorite Theorems: Probabilistically Checkable ProofsLance Fortnowhttp://www.blogger.com/profile/06752030912874378610noreply@blogger.comBlogger2125tag:blogger.com,1999:blog-3722233.post-1084522932409805812004-05-14T03:22:00.000-05:002004-05-14T03:22:00.000-05:00It seems like a lot of the really great papers hav...It seems like a lot of the really great papers have rather modest titles. I think it's cute.<br /><br />Speaking of cute, is there another researcher named Haringstad, or is the html for a with a ring over it just ˚ or something similar?<br /><br />:)<br /><br />EricAnonymousnoreply@blogger.comtag:blogger.com,1999:blog-3722233.post-1084512559759420732004-05-14T00:29:00.000-05:002004-05-14T00:29:00.000-05:00A rather modest title for a paper of such stature,...A rather modest title for a paper of such stature, no? Was it meant as a joke?Anonymousnoreply@blogger.com