986 search results - page 59 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
107
click to vote
COCO
2010
Springer
15 years 7 months ago
2010
Springer
We describe a new approach for the problem of finding rigid matrices, as posed by Valiant [Val77], by connecting it to the, seemingly unrelated, problem of proving lower bounds f...
225
Voted
ICDT
2009
ACM
16 years 4 months ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
124
Voted
LATA
2010
Springer
16 years 25 days ago
2010
Springer
This paper presents a new polynomial-time algorithm for the inclusion problem for certain pairs of regular expressions. The algorithm is not based on construction of finite automat...
128
Voted
ICLP
2001
Springer
15 years 8 months ago
2001
Springer
In the paper we establish the xed-parameter complexity for several parameterized decision problems involving models, supported models and stable models of logic programs. We also e...
162
Voted
PODS
2012
ACM
13 years 5 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...