|
On the Summmary of P and NP problem,
take notice of the following important points:
1. This problem is a complex problem,
composed of two different parts or two
different problems.
2. The verification part (or polynomial DTM part)
can be very simple, such as The Hamiltonian Problem,
or it can be very complex, such as The Satisfiability
Problem. This is because The Satisfiability Problem
is not a NP problem at all as polynomial verification
is not always true.
3. The solution part (or the real polynomial DTM part)
can be very complex, such as The Hamiltonian Problem,
The Satisfiability Problem, or some other problems.
4. NDTM is only for theoretical propostion, NDTM is not
possible in practice, so it's better that you do DTM analyses only.
5. NP complete class is actually not existent, but
P != NP is always true.
If you know all these well, you will know that trying solving
some practical problems such as The Hamiltonian
Problem, The Satisfiability Problem, and so on so forth are
meaningless, instances can only be designed (very hard)
to beak any particular implementation.
True good test almost always harder than theoretical analysis.
Wrong implementations can easily accept any instance and
give 'wrong' answers.
Only good theories or theorems are the same.
For this problem, theoretical analysis is the best
indispensible mothod.
Good analyses will save you a lot of 'troubles'.
Have a good time!
Archiver|手机版|科学网 ( 京ICP备07017567号-12 )
GMT+8, 2024-10-20 01:56
Powered by ScienceNet.cn
Copyright © 2007- 中国科学报社