451 search results - page 87 / 91 » On Parameterized Exponential Time Complexity |
BIRD
2008
Springer
14 years 1 days ago
2008
Springer
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
CONCUR
2009
Springer
14 years 4 months ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
COCO
2004
Springer
14 years 3 months ago
2004
Springer
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
STOC
2010
ACM
14 years 2 months ago
2010
ACM
We define a new interactive differentially private mechanism — the median mechanism — for answering arbitrary predicate queries that arrive online. Given fixed accuracy and...
CONCUR
2000
Springer
14 years 2 months ago
2000
Springer
In the synchronous composition of processes, one process may prevent another process from proceeding unless compositions without a wellde ned productbehavior are ruled out. They ca...