9842 search results - page 215 / 1969 » The Complexity of the Matching-Cut Problem |
FCT
2001
Springer
14 years 3 months ago
2001
Springer
Abstract. The maximum intersection problem for a matroid and a greedoid, given by polynomial-time oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in...
IWPEC
2009
Springer
14 years 5 months ago
2009
Springer
We study the Hospitals/Residents with Couples problem, a variant of the classical Stable Marriage problem. This is the extension of the Hospitals/Residents problem where residents ...
ICTAI
2008
IEEE
14 years 5 months ago
2008
IEEE
The Web Service Composition (WSC) problem on behavioral descriptions deals with the automatic construction of a coordinator web service to control a set of web services to reach t...
COMPGEOM
1996
ACM
14 years 2 months ago
1996
ACM
This paper addresses the complexity of computing the smallest-radius infinite cylinder that encloses an input set of n points in 3-space. We show that the problem can be solved in...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We develop a theory of online learning by defining several complexity measures. Among them are analogues of Rademacher complexity, covering numbers and fatshattering dimension fro...