986 search results - page 71 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
121
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
143
Voted
CADE
1999
Springer
15 years 7 months ago
1999
Springer
We present a PSpace algorithm that decides satisfiability of the graded modal logic Gr(KR)—a natural extension of propositional modal logic KR by counting expressions—which pl...
141
click to vote
FCT
2007
Springer
15 years 9 months ago
2007
Springer
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether S is a semigroup or ...
109
Voted
CIAC
2006
Springer
15 years 7 months ago
2006
Springer
We investigate the computational hardness of the Connectivity, the Strong Connectivity and the Broadcast type of Range Assignment Problems in R2 and R3. We present new reductions ...
202
Voted
APPROX
2011
Springer
14 years 3 months ago
2011
Springer
In this work we consider the problem of approximating the number of relevant variables in a function given query access to the function. Since obtaining a multiplicative factor ap...