ONT Re: Intractatus
~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o
| 5.5. Half a loaf ...
|
| If we simply 'have' to solve an NP-complete problem,
| then we are faced with a very long computation.
| Is there anything that can be done to lighten
| the load? In a number of cases various kinds
| of probabilistic and approximate algorithms
| have been developed, some very ingenious,
| and these may often be quite serviceable,
| as we have already seen in the case of
| primality testing. Here are some
| categories of "near" solutions
| that have been developed.
Et sic deinceps, he goes on from there,
but most importantly, he does go on ...
| Reference
|
| Wilf, Herbert S.,
|'Algorithms and Complexity',
| Prentice-Hall, Englewood Cliffs, NJ, 1986.
o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o