3415 search results - page 196 / 683 » Lower bounds on kernelization |
198
click to vote
ICALP
2004
Springer
16 years 13 days ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
199
Voted
MSWIM
2003
ACM
16 years 9 days ago
2003
ACM
This article analyzes the connectivity of multihop radio networks in a log-normal shadow fading environment. Assuming the nodes have equal transmission capabilities and are randoml...
181
click to vote
FOCS
2002
IEEE
16 years 10 hour ago
2002
IEEE
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...
166
click to vote
DAGSTUHL
2004
15 years 8 months ago
2004
If Alice has x, y, Bob has x, z and Carol has y, z can they determine if x + y + z = N? They can if (say) Alice broadcasts x to Bob and Carol; can they do better? Chandra, Furst, a...
193
click to vote
JCO
2008
15 years 7 months ago
2008
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...