Abstract
In this chapter we give evidence for the NP-completeness of the shapes problem. The chapter contains three separate proofs, each of which is a reduction from a known NP-complete problem. Two of these proofs are reductions from set cover, and will be known as set cover I, and set cover II. The third proof is a reduction from the 3-colorability problem.4, 10, 11, 13, 14
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1987 Kluwer Academic Publishers
About this chapter
Cite this chapter
Mace, M.E. (1987). Shapes Problem Complexity Issues. In: Memory Storage Patterns in Parallel Processing. The Kluwer International Series in Engineering and Computer Science, vol 30. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-2001-2_5
Download citation
DOI: https://doi.org/10.1007/978-1-4613-2001-2_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-9194-7
Online ISBN: 978-1-4613-2001-2
eBook Packages: Springer Book Archive