5 citations · 7 across the 2 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2008★ 5 cited
Model Checking Positive Equality-free FO: Boolean Structures and Digraphs of Size Three
Barnaby Martin
We study the model checking problem, for fixed structures A, over positive equality-free first-order logic -- a natural generalisation of the non-uniform quantified constraint sati…
cs.CC2007★ 2 cited
On the Complexity of a Derivative Chess Problem
Barnaby Martin
We introduce QUEENS, a derivative chess problem based on the classical n-queens problem. We prove that QUEENS is NP-complete, with respect to polynomial-time reductions.