Abstract
Several problems are shown to be log space complete, when restricted to bandwidth f(n), for the subclass of NP defined by nondeterministic polynomial time bounded Turing machines with a simultaneous f(n) space restriction, denoted by NTISP(poly, f(n)). These problems are NOT-ALL-EQUAL 3SAT, MONOCHROMATIC TRIANGLE, CUBIC SUBGRAPH, DOMINATING SET, ONE-IN-THREE 3SAT and MONOTONE 3SAT. The problems DOMATIC NUMBER, PARTITION INTO FORESTS and DISJOINT CONNECTING PATHS restricted to bandwidth f(n) are shown to be log space hard for NTISP(poly, f(n)). Their membership in the class NTISP(poly, f(n)) is currently open. As one application of these results, we note that the first six of the problems mentioned are examples of NSPACE(log n) complete problems when restricted to bandwidth log n.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
