3415 search results - page 460 / 683 » Lower bounds on kernelization |
180
click to vote
COCOON
2005
Springer
16 years 2 days ago
2005
Springer
This paper gives a quantum algorithm to search in an set S for a k-tuple satisfying some predefined relation, with the promise that some components of a desired k-tuple are in som...
163
click to vote
COLT
2005
Springer
16 years 2 days ago
2005
Springer
We consider the problem of learning a hypergraph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden hypergr...
140
click to vote
ISAAC
2005
Springer
16 years 1 days ago
2005
Springer
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...
193
click to vote
STACS
2005
Springer
16 years 14 hour ago
2005
Springer
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
172
click to vote
STACS
2005
Springer
16 years 14 hour ago
2005
Springer
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...