1920 search results - page 100 / 384 » The Complexity of the A B C Problem |
193
click to vote
CCCG
2009
15 years 7 months ago
2009
Clarkson's algorithm is a two-staged randomized algorithm for solving linear programs, but it can also be applied to the more general LP-type problems which comprise a number...
178
click to vote
ASIAMS
2007
IEEE
16 years 23 days ago
2007
IEEE
The tree structure has received much interest as a versatile architecture for a large class of parallel processing applications. Spanning trees in particular are essential tools f...
135
click to vote
SIAMAM
2000
15 years 6 months ago
2000
We study propagation failure using the one-dimensional scalar bistable equation with a passive "gap" region. By applying comparison principles for this type of equation, ...
178
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
166
click to vote
STACS
2000
Springer
15 years 10 months ago
2000
Springer
We show that there is a set that is almost complete but not complete under polynomial-time many-one (p-m) reductions for the class E of sets computable in deterministic time 2lin ...