9842 search results - page 30 / 1969 » The Complexity of the Matching-Cut Problem |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
MSCS
2010
13 years 2 months ago
2010
JC
2007
13 years 7 months ago
2007
We extend the lower bounds on the complexity of computing Betti numbers proved in [6] to complex algebraic varieties. More precisely, we first prove that the problem of deciding ...
PODS
2011
ACM
12 years 10 months ago
2011
ACM
Complex Event Processing (CEP) Systems are stream processing systems that monitor incoming event streams in search of userspecified event patterns. While CEP systems have been ad...
STOC
2012
ACM
11 years 10 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...