10988 search results - page 127 / 2198 » Algorithmic Folding Complexity |
120
click to vote
STOC
2005
ACM
15 years 8 months ago
2005
ACM
We study the round complexity of two-party protocols for generating a random nbit string such that the output is guaranteed to have bounded bias (according to some measure) even i...
155
Voted
DFG
1992
Springer
15 years 6 months ago
1992
Springer
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
155
click to vote
LCC
1994
15 years 6 months ago
1994
We give an AC0 upper bound on the complexity of rst-oder queries over (in nite) databases de ned by restricted linear constraints. This result enables us to deduce the non-expressi...
119
click to vote
AAAI
2004
15 years 4 months ago
2004
This paper presents a discussion of the theoretical complexity of plan recognition on the basis of an analysis of the number of explanations that any complete plan recognition alg...
111
click to vote
CJ
2008
15 years 2 months ago
2008
The article surveys parameterized algorithms and complexities for computational tasks on biopolymer sequences, including the problems of longest common subsequence, shortest commo...