| |
|
Science Forum Index » Logic Forum » NP Incomplete?...
Page 1 of 1
|
| Author |
Message |
| unixops... |
 Posted: Tue Jun 10, 2008 6:17 pm |
|
|
|
Guest
|
Is the following a valid assertion:
For some NP <> NP (<> not equal) such that not all infinite solutions
include the same tractability. If NP <> NP then P=NP and P<>NP
(emphasis on 'and') rather than P=NP or N<>NP?
Another way to assert NP<>NP such that some NP must include an
infinite assertion of NP<>NP? or NP Incomplete. |
|
|
| Back to top |
|
| |
|
Page 1 of 1
All times are GMT - 5 Hours
The time now is Sun Nov 23, 2008 1:01 pm
|
|
