Discussions of NP-Complete Problems

A Resource for Computer Science Educators

Home
About the SIte
Bibliography
How to get the archive password

Tag Archives: 3-sat

Protected: Chinese Postman for Mixed Graphs

Enter your password to view comments.

This content is password-protected. To view it, please enter the password below.

Password:

This entry was posted in Appendix- Network Design and tagged 3-sat, Chinese Postman, Difficulty 9, ND25 on March 7, 2016 by Sean T. McCulloch.

Protected: Multiple Choice Branching

Enter your password to view comments.

This content is password-protected. To view it, please enter the password below.

Password:

This entry was posted in Appendix- Network Design and tagged 3-sat, Difficulty 6, Multiple Choice Branching, No G&J reference, uncited reduction on January 12, 2016 by Sean T. McCulloch.

Protected: Capacitated Spanning Tree

Enter your password to view comments.

This content is password-protected. To view it, please enter the password below.

Password:

This entry was posted in Appendix- Network Design and tagged 3-sat, Capacitated Spanning Tree, Difficulty 7, ND5, sat on November 3, 2015 by Sean T. McCulloch.

Protected: Metric Dimension

Enter your password to view comments.

This content is password-protected. To view it, please enter the password below.

Password:

This entry was posted in Appendix-Graph Theory and tagged 3-sat, 3DM, Difficulty 8, GT61, Metric Dimension on August 20, 2015 by Sean T. McCulloch.

Protected: Kernel

Enter your password to view comments.

This content is password-protected. To view it, please enter the password below.

Password:

This entry was posted in Appendix-Graph Theory and tagged 3-sat, Difficulty 6, GT57, Kernel, Vertex Cover on August 4, 2015 by Sean T. McCulloch.

Protected: Multiple Choice Matching

Enter your password to view comments.

This content is password-protected. To view it, please enter the password below.

Password:

This entry was posted in Appendix-Graph Theory and tagged 3-sat, Difficulty 6, GT55, Multiple Choice Matching, Path With Forbidden Pairs, sat on July 28, 2015 by Sean T. McCulloch.

Protected: Path With Forbidden Pairs

Enter your password to view comments.

This content is password-protected. To view it, please enter the password below.

Password:

This entry was posted in Appendix-Graph Theory and tagged 3-sat, Difficulty 5, GT54, Path With Forbidden Pairs, uncited reduction on July 21, 2015 by Sean T. McCulloch.

Protected: Directed Elimination Ordering

Enter your password to view comments.

This content is password-protected. To view it, please enter the password below.

Password:

This entry was posted in Appendix-Graph Theory and tagged 3-sat, Difficulty 9, Directed Elimination Ordering, GT46 on June 9, 2015 by Sean T. McCulloch.

Protected: The Linear Array Problem

Enter your password to view comments.

This content is password-protected. To view it, please enter the password below.

Password:

This entry was posted in Appendix-Graph Theory and tagged 3-sat, Difficulty 2, Difficulty 7, Directed Hamiltonian Circuit, GT37, GT38, GT39, GT40, Linear Array on April 7, 2015 by Sean T. McCulloch.

Protected: One-In-Three 3SAT

Enter your password to view comments.

This content is password-protected. To view it, please enter the password below.

Password:

This entry was posted in Appendix-Logic and tagged 3-sat, Difficulty 7, LO4, NAE3SAT, One-In-Three 3SAT, uncited reduction on February 24, 2015 by Sean T. McCulloch.

Post navigation

← Older posts

Newer posts →

Search for: