2430 search results - page 356 / 486 » Computing Tutte Polynomials |
121
click to vote
COCO
2009
Springer
15 years 10 months ago
2009
Springer
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
116
Voted
DCOSS
2009
Springer
15 years 10 months ago
2009
Springer
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
105
Voted
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
We consider finite graphs whose edges are labeled with elements, called colors, taken from a fixed finite alphabet. We study the problem of determining whether there is an infi...
108
click to vote
SAGT
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In game theory, a player’s action is said to be weakly dominated if there exists another action that, with respect to what the other players do, is never worse and some...
116
Voted
TAMC
2009
Springer
15 years 10 months ago
2009
Springer
In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2o(f(k)) p(n)) time if and on...