15033 search results - page 420 / 3007 » Complexity Theory and Algorithms |
206
click to vote
BMCBI
2004
15 years 7 months ago
2004
Background: In a previous paper, we introduced MUSCLE, a new program for creating multiple alignments of protein sequences, giving a brief summary of the algorithm and showing MUS...
206
click to vote
SMA
2005
ACM
16 years 1 months ago
2005
ACM
Nef polyhedra in d-dimensional space are the closure of half-spaces under boolean set operation. In consequence, they can represent non-manifold situations, open and closed sets, ...
202
click to vote
COCO
2005
Springer
16 years 1 months ago
2005
Springer
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
223
click to vote
FUN
2010
Springer
16 years 15 days ago
2010
Springer
We study the complexity of the popular one player combinatorial game known as Flood-It. In this game the player is given an n×n board of tiles where each tile is allocated one of ...
211
click to vote
COMPGEOM
2009
ACM
16 years 2 months ago
2009
ACM
Topological persistence has proven to be a key concept for the study of real-valued functions defined over topological spaces. Its validity relies on the fundamental property tha...