SIAMCOMP
2008
13 years 4 months ago
2008
Abstract. Monadic second-order unification is second-order unification where all function constants occurring in the equations are unary. Here we prove that the problem of deciding...
SIAMCOMP
2008
13 years 4 months ago
2008
SIAMCOMP
2008
13 years 4 months ago
2008
We show that the treewidth and the minimum fill-in of an n-vertex graph can be
SIAMCOMP
2008
13 years 4 months ago
2008
SIAMCOMP
2008
13 years 4 months ago
2008
SIAMCOMP
2008
13 years 4 months ago
2008
We give constructions of probabilistically checkable proofs (PCPs) of length n
SIAMCOMP
2008
13 years 4 months ago
2008
We show that neither Resolution nor tree-like Resolution is automatizable unless the class W[P] from the hierarchy of parameterized problems is fixed-parameter tractable by randomi...
SIAMCOMP
2008
13 years 4 months ago
2008
XML specifications often consist of a type definition (typically, a DTD) and a set of integrity constraints. It has been shown previously that such specifications can be inconsiste...
SIAMCOMP
2008
13 years 4 months ago
2008
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
SIAMCOMP
2008
13 years 4 months ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...