10988 search results - page 231 / 2198 » Algorithmic Folding Complexity |
138
click to vote
FCT
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...
126
Voted
COCO
2009
Springer
15 years 10 months ago
2009
Springer
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
132
click to vote
CSL
2005
Springer
15 years 9 months ago
2005
Springer
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
130
click to vote
COCOON
2007
Springer
15 years 10 months ago
2007
Springer
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
153
click to vote
EGPGV
2004
Springer
15 years 9 months ago
2004
Springer
This paper investigates assignment strategies (load balancing algorithms) for process farms which solve the problem of online placement of a constant number of independent tasks w...