Tag Archives: Not in Appendix

Protected: Word Problem For Products of Symmetric Groups

Posted on August 18, 2021 | Enter your password to view comments.

Enter your password to view comments.

Posted in Appendix- Program Optimization

Tagged Difficulty 7, Disjoint Connecting Paths, No G&J reference, Not in Appendix, WPPSG

Protected: Regular Expression Inequivalence on Single Character Alphabets

Posted on February 17, 2021 | Enter your password to view comments.

Enter your password to view comments.

Posted in Uncategorized

Tagged 3SAT, Difficulty 8, Not in Appendix, Regular Expression Inequivalence on Single Character Alphabets

Protected: Linear Space Acceptance

Posted on November 25, 2020 | Enter your password to view comments.

Enter your password to view comments.

Posted in Problems not in appendix

Tagged Difficulty 4, Linear Bounded Automaton Acceptance, Linear Space Acceptance, Not in Appendix, QBF

Protected: Maximum Leaf Spanning Tree, Connected Dominating Set

Posted on October 13, 2015 | Enter your password to view comments.

Enter your password to view comments.

Posted in Appendix- Network Design

Tagged Difficulty 2, Difficulty 5, Dominating Set, Hamiltonian Path, ND2, No G&J reference, Not in Appendix, uncited reduction, Vertex Cover

Protected: Hamiltonian Path on Bipartite Graphs

Posted on December 30, 2014 | Enter your password to view comments.

Enter your password to view comments.

Posted in Appendix-Graph Theory

Tagged Difficulty 5, Hamiltonian Circuit, Hamiltonian Path, Hamiltonian Path on Bipartite Graphs, Not in Appendix