Skip to content

Discussions of NP-Complete Problems

A Resource for Computer Science Educators

Home
About the SIte
Bibliography
How to get the archive password

Tag Archives: Not in Appendix

Protected: Word Problem For Products of Symmetric Groups

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- Program Optimization and tagged Difficulty 7, Disjoint Connecting Paths, No G&J reference, Not in Appendix, WPPSG on August 18, 2021 by Sean T. McCulloch.

Protected: Regular Expression Inequivalence on Single Character Alphabets

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 Uncategorized and tagged 3SAT, Difficulty 8, Not in Appendix, Regular Expression Inequivalence on Single Character Alphabets on February 17, 2021 by Sean T. McCulloch.

Protected: Linear Space Acceptance

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 Problems not in appendix and tagged Difficulty 4, Linear Bounded Automaton Acceptance, Linear Space Acceptance, Not in Appendix, QBF on November 25, 2020 by Sean T. McCulloch.

Protected: Maximum Leaf Spanning Tree, Connected Dominating Set

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 Difficulty 2, Difficulty 5, Dominating Set, Hamiltonian Path, ND2, No G&J reference, Not in Appendix, uncited reduction, Vertex Cover on October 13, 2015 by Sean T. McCulloch.

Protected: Hamiltonian Path on Bipartite 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-Graph Theory and tagged Difficulty 5, Hamiltonian Circuit, Hamiltonian Path, Hamiltonian Path on Bipartite Graphs, Not in Appendix on December 30, 2014 by Sean T. McCulloch.

Search for:

Recent Posts

And That’s It! August 21, 2025
Fault Detection With Test Points August 20, 2025
Fault Detection in Directed Graphs August 13, 2025
Fault Detection in Logic Circuits March 8, 2024
Minimum Weight And/Or Graph Solution February 15, 2024

Recent Comments

Sean T. McCulloch on And That’s It!
Greg Hamerly on And That’s It!
Sean T. McCulloch on Exact Cover by 3-Sets
nifets on Exact Cover by 3-Sets
Sean T. McCulloch on Fault Detection in Logic Circuits

Archives

Categories

Algebra and Number Theory
Appendix- Algebra and Number Theory
Appendix- Automata and Language Theory
Appendix- Games and Puzzles
Appendix- Mathematical Programming
Appendix- Network Design
Appendix- Program Optimization
Appendix- Sets and Partitions
Appendix-Graph Theory
Appendix-Logic
Appendix: Miscellaneous
Appendix: Sequencing and Scheduling
Appendix: Storage and Retrieval
Chapter 3 Exercises
Core Problems
Overview
Problems not in appendix
Uncategorized

Proudly powered by WordPress