1650 search results - page 24 / 330 » The HOM problem is decidable |
ICSE
2005
IEEE-ACM
14 years 7 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...
FSTTCS
2007
Springer
14 years 1 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 ...
CONSTRAINTS
2010
13 years 5 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 ...
ORL
2007
13 years 7 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...
FOSSACS
2012
Springer
12 years 3 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...