Delete comment from: Computational Complexity
theorems in algebraic geometry are usually much simpler to prove, once their meaning have been deciphered,
Ever try to read Hironaka's proof of resolution of singularities or for that matter the EGA and SGA. Actually, the typical reading list for a graduate student in algebraic geometry has more mathematical depth and content (not to mention current research) than all STOC/FOCS proceedings taken together. Moreover, the anon comment was referring to the "mathematical content" of the papers. Most FOCS/STOC papers have zero math content -- a few (probably less than 5%) have a positive amount. But outside a few outstanding examples most of them will get a very short shift in a (general) math journal of any repute. Just try submitting such a paper if you do not believe me.
Aug 17, 2010, 11:19:59 AM
Posted to But This One Is Different...