Discussions of NP-Complete Problems

A Resource for Computer Science Educators

Home
About the SIte
Bibliography
How to get the archive password

Category Archives: Appendix: Storage and Retrieval

Protected: Consecutive Ones Matrix Augmentation

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix: Storage and Retrieval and tagged Consecutive Ones Matrix Augmentation, Consecutive Ones Matrix Problems, Consecutive Ones Submatrix, Difficulty 4, Difficulty 6, Optimal Linear Arrangement, SR16 on May 16, 2017 by Sean T. McCulloch.

Protected: Consecutive Ones Submatrix

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix: Storage and Retrieval and tagged Consecutive Ones Property, Consecutive Ones Submatrix, Difficulty 5, Hamiltonian Path, SR14 on May 10, 2017 by Sean T. McCulloch.

Protected: Sparse Matrix Compression

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix: Storage and Retrieval and tagged Difficulty 6, Graph 3-coloring, No G&J reference, Shortest Common Superstring, Sparse Matrix Compression, SR13, stumped, uncited reduction on May 5, 2017 by Sean T. McCulloch.

Protected: Hitting String

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix: Storage and Retrieval and tagged 3SAT, Difficulty 4, Hitting String, SR12, uncited reduction on April 26, 2017 by Sean T. McCulloch.

Protected: Bounded Post Correspondence Problem

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix: Storage and Retrieval and tagged Bounded Post Correspondence Problem, Difficulty 10, Hamiltonian Circuit, Shortest Common Supersequence, SR11 on April 19, 2017 by Sean T. McCulloch.

Protected: Shortest Common Superstring

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix: Storage and Retrieval and tagged Shortest Common Supersequence, Shortest Common Superstring, SR9, VC<=3 on April 12, 2017 by Sean T. McCulloch.

Protected: Shortest Common Supersequence

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix: Storage and Retrieval and tagged Difficulty 8, Longest Common Subsequence, Shortest Common Supersequence, SR8, Vertex Cover on April 7, 2017 by Sean T. McCulloch.

Protected: Longest Common Subsequence

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix: Storage and Retrieval and tagged Difficulty 5, Longest Common Subsequence, SR10, Vertex Cover on March 29, 2017 by Sean T. McCulloch.

Protected: Capacity Assignment

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix: Storage and Retrieval and tagged Capacity Assignment, Difficulty 4, No G&J reference, SOS, SR7, uncited reduction on March 22, 2017 by Sean T. McCulloch.

Protected: Multiple Copy File Allocation

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix: Storage and Retrieval and tagged Multiple Copy File Allocation, No G&J reference, SR6, uncited reduction on March 15, 2017 by Sean T. McCulloch.

← Older posts

Newer posts →

Search for: