2009-05-05 22:35
weekly report
Name: Yuh-Dauh Lyuu (Student ID; email address)
Date: June 11, 2005
Report Title: A Proof for P=NP
Summary/Comments
Cook (1971) made the important step of reducing the “P=NP” problem to proving that an NP-complete problem is in P. Last night, I had finally obtained a definitive proof for P=NP. The argument goes roughly as follows. ….
Papers I plan to read:
1. Dongarra, et al. “First Gordon Bell Awards Winners ...” IEEE Software 5(3), May 1988, pp. 108.
2. Key, J. “Supercomputer Performance in the Year 2000.” Supercomputing Review, November 1990, pp. 40ff.
3. Hill. “What Is Scalability?” Computer Architecture News 18(4), December 1990, pp. 18–21.
4. Acharya, Das, and Sundaram. “Pricing Credit Derivatives with Rating Transitions.” Financial Analysts Journal, May/June 2002, pp. 28–44.
Date: June 11, 2005
Report Title: A Proof for P=NP
Summary/Comments
Cook (1971) made the important step of reducing the “P=NP” problem to proving that an NP-complete problem is in P. Last night, I had finally obtained a definitive proof for P=NP. The argument goes roughly as follows. ….
Papers I plan to read:
1. Dongarra, et al. “First Gordon Bell Awards Winners ...” IEEE Software 5(3), May 1988, pp. 108.
2. Key, J. “Supercomputer Performance in the Year 2000.” Supercomputing Review, November 1990, pp. 40ff.
3. Hill. “What Is Scalability?” Computer Architecture News 18(4), December 1990, pp. 18–21.
4. Acharya, Das, and Sundaram. “Pricing Credit Derivatives with Rating Transitions.” Financial Analysts Journal, May/June 2002, pp. 28–44.
没有评论:
发表评论