9842 search results - page 241 / 1969 » The Complexity of the Matching-Cut Problem |
122
click to vote
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
The AND problem on t bits is a promise decision problem where either at most one bit of the input is set to 1 (NO instance) or all t bits are set to 1 (YES instance). In this note...
143
click to vote
WINE
2009
Springer
15 years 10 months ago
2009
Springer
A well-known result due to Vickery gives a mechanism for selling a number of goods to interested buyers in a way that achieves the maximum social welfare. In practice, a problem wi...
124
Voted
DCC
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper derives bounds on the distortion rate function for quantization on the complex projective space denoted as CPn−1 . In essence the problem of quantization in an Euclid...
132
click to vote
ACSD
2005
IEEE
15 years 9 months ago
2005
IEEE
We consider the distributed implementability problem as: Given a labeled transition system TS together with a distribution ∆ of its actions over a set of processes, does there ex...
123
click to vote
SPAA
2003
ACM
15 years 9 months ago
2003
ACM
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...