Abstract
The ordering among classes of isomorphic NP-complete optimization problems is studied from a lattice theoretic point of view. It is shown that the set of such classes has the structure of an upper semilattice; while a top element can found be it is proved that no bottom element can exist.
Get full access to this article
View all access options for this article.