The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems)

Martin Fürer. The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems). In Egon Börger, Gisbert Hasenjaeger, Dieter Rödding, editors, Logic and Machines: Decision Problems and Complexity, Proceedings of the Symposium Rekursive Kombinatorik held from May 23-28, 1983 at the Institut für Mathematische Logik und Grundlagenforschung der Universität Münster/Westfahlen. Volume 171 of Lecture Notes in Computer Science, pages 312-319, Springer, 1983.

No reviews for this publication, yet.