1650 search results - page 29 / 330 » The HOM problem is decidable |
IJAC
2010
13 years 6 months ago
2010
We show that the compressed word problem in a finitely generated fully residually free group (F-group) is decidable in polynomial time, and use this result to show that the word ...
POPL
2002
ACM
14 years 8 months ago
2002
ACM
We investigate the first-order theory of subtyping constraints. We show that the first-order theory of nonstructural subtyping is undecidable, and we show that in the case where a...
DAGSTUHL
2007
13 years 9 months ago
2007
To decide if the parameterized feedback vertex set problem in directed graph is fixed-parameter tractable is a long standing open problem. In this paper, we prove that the paramet...
ENDM
2007
13 years 7 months ago
2007
Given a metric d on a permutation group G, the corresponding weight problem is to decide whether there exists an element g ∈ G such that d(g, e) = k for some k ∈ N. In this pa...
IANDC
2008
13 years 7 months ago
2008
We consider a permutation-based model for the gene assembly process in ciliates. We give a procedure to decide whether a given micronuclear molecules may be assembled by using onl...