1650 search results - page 24 / 330 » The HOM problem is decidable |
111
click to vote
ICSE
2005
IEEE-ACM
16 years 4 months ago
2005
IEEE-ACM
Software has jumped "out of the box" ? it controls critical systems, pervades business and commerce, and infuses entertainment, communication, and other everyday activiti...
121
click to vote
FSTTCS
2007
Springer
15 years 10 months ago
2007
Springer
We introduce PEP, the Post Embedding Problem, a variant of PCP where one compares strings with the subword relation, and PEPreg , a further variant where solutions are constrained ...
164
click to vote
CONSTRAINTS
2010
15 years 1 months ago
2010
The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a global constraint and an associated ...
132
click to vote
ORL
2007
15 years 3 months ago
2007
We prove that it is NP-complete to decide whether a bipartite graph of maximum degree three on nk vertices can be partitioned into n paths of length k. Finally, we propose some ap...
136
click to vote
FOSSACS
2012
Springer
13 years 11 months ago
2012
Springer
We consider concurrent games played on graphs, in which each player has several qualitative (e.g. reachability or B¨uchi) objectives, and a preorder on these objectives (for insta...