论文信息 - BOUNDED TILING, an alternative to SATISFIABILITY ? - 字舞流文

BOUNDED TILING, an alternative to SATISFIABILITY ?

Martin W. P. Savelsbergh | P EmdeBoasvan

[1] Harry R. Lewis,et al. Complexity of solvable cases of the decision problem for the predicate calculus , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[2] D. Harel. Recurring dominoes: making the highly undecidable highly understandable , 1985 .