9842 search results - page 92 / 1969 » The Complexity of the Matching-Cut Problem |
170
click to vote
PODS
1994
ACM
15 years 7 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
131
click to vote
WG
2004
Springer
15 years 8 months ago
2004
Springer
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
137
click to vote
ESA
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation. They are of fundamental importance for a variety of applications including m...
110
click to vote
FCT
2005
Springer
15 years 8 months ago
2005
Springer
We prove completeness results for twenty-three problems in semilinear geometry. These results involve semilinear sets given by additive circuits as input data. If arbitrary real co...
132
click to vote
AVI
2008
15 years 5 months ago
2008
In this paper we discuss the problem of deploying appliances for interactive services in complex physical environments using a knowledge based approach to define the relations bet...