On Jan 15, 2008 10:49 PM, Jim Bromer <[EMAIL PROTECTED]> wrote: > > At any rate, I should have a better idea if the idea will work or not by the > end of the year. > Lucky you, last time I proved P=NP it only lasted two days ;-) Some resources for people caught by this off-topic thread:
- old year's celebrity: PCP Theorem by Gap Amplification http://www.cs.huji.ac.il/~dinuri/mypapers/combpcp.pdf - Introduction to Complexity Theory (Lecture Notes): http://www.wisdom.weizmann.ac.il/~oded/cc-sum.html - complexities do collapse at times (L=SL, 2004): Undirected ST-connectivity in Log-Space http://www.wisdom.weizmann.ac.il/~reingold/publications/sl.ps ----- This list is sponsored by AGIRI: http://www.agiri.org/email To unsubscribe or change your options, please go to: http://v2.listbox.com/member/?member_id=8660244&id_secret=86291535-6f34ee
