𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Closeness of NP-Hard Sets to Other Complexity Classes

✍ Scribed by Fu, Bin; Li, Hong-Zhou

Book ID
118177316
Publisher
Society for Industrial and Applied Mathematics
Year
1994
Tongue
English
Weight
756 KB
Volume
23
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On easy and hard hereditary classes of g
On easy and hard hereditary classes of graphs with respect to the independent set problem
✍ Vladimir E. Alekseev πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 162 KB

In this paper we introduce the concept of a boundary class, which is a helpful tool for classiΓΏcation of hereditary classes of graphs according to the complexity of the independent set problem. It is shown that in a class X deΓΏned by a ΓΏnite set of forbidden induced subgraphs, the problem is NP-hard