9842 search results - page 50 / 1969 » The Complexity of the Matching-Cut Problem |
RSA
2006
13 years 7 months ago
2006
Abstract. We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models ...
MOC
2000
13 years 7 months ago
2000
We treat the time discretization of an initial-value problem for a ous abstract parabolic equation by first using a representation of the solution as an integral along the boundary...
LATIN
2010
Springer
13 years 6 months ago
2010
Springer
Abstract In this paper, we settle the open complexity status of interval constrained coloring with a fixed number of colors. We prove that the problem is already NP-complete if th...
CCDS
2010
13 years 5 months ago
2010
We outline a discretization approach to determine the maximal number of mutually unbiased bases in dimension 6. We describe the basic ideas and introduce the most important definit...
MST
2010
13 years 2 months ago
2010
The 1-versus-2 queries problem, which has been extensively studied in computational complexity theory, asks in its generality whether every efficient algorithm that makes at most 2...