Blanchet-Sadri et al. have shown that Avoidability, or the problem of deciding the avoidability of a finite set of partial words over an alphabet of size k 2, is NP-hard [Theoret...
We show that, for every finite field , the class of all representable matroids of branch-width at most a constant t has a decidable MSO theory. In the other direction, we p...
We prove that there exists a structure M whose monadic second order theory is decidable, and such that the elementary theory of every expansion of M by a constant is undecidable. 1...
We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...