9842 search results - page 397 / 1969 » The Complexity of the Matching-Cut Problem |
143
click to vote
FSTTCS
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We prove several results about the average-case complexity of problems in the Polynomial Hierarchy (PH). We give a connection among average-case, worst-case, and non-unif...
143
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
We consider Coalitional Skill Games (CSGs), a simple model of cooperation among agents. This is a restricted form of coalitional games, where each agent has a set of skills that a...
126
click to vote
AIPS
2006
15 years 5 months ago
2006
We study the consequences on complexity that arise when bounds on the number of branch points on the solutions for non-deterministic planning problems are imposed as well as when ...
127
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
We resolve an open problem regarding the complexity of unweighted coalitional manipulation, namely, the complexity of Copeland -manipulation for {0, 1}. Copeland , 0 1, is an...
121
click to vote
HICSS
1998
IEEE
15 years 8 months ago
1998
IEEE
The Digital Agora is an information resource that supports understanding and analysis of complex problems in the social sciences. Large amounts of data are available from many dif...