@dblp

Complexity of hierarchically and 1-dimensional periodically specified problems I: Hardness results.

, , , and . Satisfiability Problem: Theory and Applications, volume 35 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 225-259. DIMACS/AMS, (1996)

Links and resources

Tags