9842 search results - page 61 / 1969 » The Complexity of the Matching-Cut Problem |
MFCS
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
LATIN
2000
Springer
13 years 11 months ago
2000
Springer
In this paper, we consider the open problem of the complexity of the LLL algorithm in the case when the approximation parameter of the algorithm has its extreme value
CLIMA
2010
13 years 7 months ago
2010
When agents are acting together, they may need a simple mechanism to decide on joint actions. One possibility is to have the agents express their preferences in the form of a ballo...
COMPLEXITY
2010
13 years 5 months ago
2010
In this paper we introduce the Partition Task problem class along with a complexity measure to evaluate its instances and a performance measure to quantify the ability of a system...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We study cellular automata with respect to a new communication complexity problem: each of two players know half of some finite word, and must be able to tell whether the state o...