9842 search results - page 269 / 1969 » The Complexity of the Matching-Cut Problem |
116
Voted
COCO
2003
Springer
15 years 5 months ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
109
Voted
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
96
Voted
LADS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract The variety of existing agent-based simulations is overwhelming. However – especially when comparing agent-based simulation to other simulation paradigms, a reference fr...
131
click to vote
SIGECOM
2006
ACM
15 years 6 months ago
2006
ACM
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
124
Voted
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract— We consider the problem of estimating cascaded aggregates over a matrix presented as a sequence of updates in a data stream. A cascaded aggregate P ◦Q is defined by ...