986 search results - page 164 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
150
click to vote
JMMA
2002
15 years 3 months ago
2002
Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation h...
145
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
In the paper, the global optimization problem of a multidimensional “black-box” function satisfying the Lipschitz condition over a hyperinterval with an unknown Lipschitz const...
150
Voted
LFCS
2007
Springer
15 years 9 months ago
2007
Springer
We present a general algorithm scheme for model checking logics of knowledge, common knowledge and linear time, based on simulations to a class of structures that capture the way t...
142
Voted
COCOON
2005
Springer
15 years 9 months 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...
119
Voted
COLT
2005
Springer
15 years 9 months 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...