42230 search results - page 411 / 8446 » Algorithms and Complexity Results for |
153
click to vote
COCO
2007
Springer
16 years 1 months ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
159
Voted
SIGECOM
2006
ACM
16 years 25 days ago
2006
ACM
We study coalitional games where the value of cooperation among the agents are solely determined by the attributes the agents possess, with no assumption as to how these attribute...
139
click to vote
COCO
1994
Springer
15 years 11 months ago
1994
Springer
Recent results by Toda, Vinay, Damm, and Valiant have shown that the complexity of the determinant is characterized by the complexity of counting the number of accepting computati...
183
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
: Malicious users try to compromise systems using new techniques. One of the recent techniques used by the attacker is to perform complex distributed attacks such as denial of serv...
185
Voted
IPL
2002
15 years 6 months ago
2002
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...