Re: Factoring integers on a classical computer
From: Pubkeybreaker (Robert_silverman_at_raytheon.com)
Date: 03/17/05
- Next message: richard miller: "Re: FLTMA: Verification of "large zero""
- Previous message: Lester Zick: "Re: Epistemology 201: The Science of Science"
- In reply to: Craig Feinstein: "Re: Factoring integers on a classical computer"
- Next in thread: Craig Feinstein: "Re: Factoring integers on a classical computer"
- Reply: Craig Feinstein: "Re: Factoring integers on a classical computer"
- Reply: tchow_at_lsa.umich.edu: "Re: Factoring integers on a classical computer"
- Messages sorted by: [ date ] [ thread ]
Date: 17 Mar 2005 11:47:52 -0800
"Can anyone give an example of a problem in
which determining whether a solution exists is easy (can be done in
poly-time), but where finding the solution has been proven to require
super-polynomial time? "
May I suggest you think about what having a proof of *any* algorithm
requiring
more than polynomial time would have upon the P = NP question.......
- Next message: richard miller: "Re: FLTMA: Verification of "large zero""
- Previous message: Lester Zick: "Re: Epistemology 201: The Science of Science"
- In reply to: Craig Feinstein: "Re: Factoring integers on a classical computer"
- Next in thread: Craig Feinstein: "Re: Factoring integers on a classical computer"
- Reply: Craig Feinstein: "Re: Factoring integers on a classical computer"
- Reply: tchow_at_lsa.umich.edu: "Re: Factoring integers on a classical computer"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|
