1650 search results - page 82 / 330 » The HOM problem is decidable |
ISAAC
2003
Springer
14 years 3 months ago
2003
Springer
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty sets V1, V2 such that for each vertex v, if v ∈ Vi th...
ICLP
2001
Springer
14 years 2 months ago
2001
Springer
In the paper we establish the xed-parameter complexity for several parameterized decision problems involving models, supported models and stable models of logic programs. We also e...
IPCV
2008
13 years 11 months ago
2008
We propose one geometric algorithm to solve both the problem of circularity test and the problem of circularity measure. The former problem consists in deciding whether a given di...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We consider the problem of deciding whether a highly incomplete signal lies within a given subspace. This problem, Matched Subspace Detection, is a classical, wellstudied problem w...
FUIN
2007
13 years 10 months ago
2007
We consider decidability questions for the emptiness problem of intersections of matrix semigroups. This problem was studied by A. Markov [7] and more recently by V. Halava and T....