Hierarchically and 1-Dimensional Periodically Specified Generalized CNF Satisfiability Problems with Applications

We study the complexity of various combinatorial problems when instances are specified usingone of the following succinct specifications: (1) the 1-dimensional finite periodic narrow specificationsof Ford et al. and Hofting and Wanke [FF58, HW95]; (2) the 1-dimensional finite periodic narrowspecifications with explicit boundary conditions of Gale [Ga59]; (3) the 2-way infinite 1-dimensionalperiodic narrow specifications of Orlin et al. [Or82a]; and (4) the hierarchical specifications of...