395 search results - page 54 / 79 » Positive Versions of Polynomial Time |
SODA
2010
ACM
15 years 7 months ago
2010
ACM
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
SPAA
2010
ACM
15 years 2 months ago
2010
ACM
We study a natural network creation game, in which each node locally tries to minimize its local diameter or its local average distance to other nodes, by swapping one incident ed...
SPIRE
2005
Springer
15 years 3 months ago
2005
Springer
We consider the problem of finding pairs of short patterns such that, in a given input sequence of length n, the distance between each pair’s patterns is at least α. The proble...
WABI
2005
Springer
15 years 3 months ago
2005
Springer
Multiple Sequence Alignment (MSA) is one of the most fundamental problems in computational molecular biology. The running time of the best known scheme for finding an optimal ali...
APPROX
2007
Springer
15 years 1 months ago
2007
Springer
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...