Bounded tiling, an alternative to satisfiability?

Additional Metadata
MSC	Complexity classes (hierarchies, relations among complexity classes, etc.) (msc 68Q15), Complexity of computation (including implicit computational complexity) (msc 03D15), Tessellation and tiling problems (msc 05B45)
Series	Mathematical Research
Conference	Frege Conference
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Savelsbergh, M. W. P., & van Emde Boas, P. (1984). Bounded tiling, an alternative to satisfiability?. In Proceedings of the Frege Conference 1984 (pp. 354–363).

Publication