986 search results - page 15 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
STOC
2004
ACM
14 years 8 months ago
2004
ACM
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
COCO
2003
Springer
14 years 25 days ago
2003
Springer
We give machine characterisations and logical descriptions of a number of parameterized complexity classes. The focus of our attention is the class W[P], which we characterise as ...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
Coalition formation is a key topic in multi–agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encoura...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
One of the earliest quantum algorithms was discovered by Bernstein and Vazirani, for a problem called Recursive Fourier Sampling. This paper shows that the Bernstein-Vazirani algo...
CATS
2008
13 years 9 months ago
2008
The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem ...