scientific article
From MaRDI portal
Publication:3341896
zbMath0549.68037MaRDI QIDQ3341896
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexitytilingdecision problem of predicate calculusnondeterministic exponential time completeunconstrained limited domino problem
Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Combinatorial aspects of tessellation and tiling problems (05B45)
Related Items
Dominoes and the complexity of subclasses of logical theories, On logics with two variables, Infinite games with finite knowledge gaps, First-order logic with two variables and unary temporal logic, Unnamed Item