1522 search results - page 21 / 305 » On the Complexity of Several Haplotyping Problems |
FSTTCS
1993
Springer
13 years 11 months ago
1993
Springer
We study the complexity of several standard problems for 1-safe Petri nets and some of its subclasses. We prove that reachability, liveness, and deadlock are all PSPACE-complete f...
DAM
2002
13 years 7 months ago
2002
The virtual ant introduced by Langton [Physica D 22 (1986) 120] has an interesting behavior, which has been studied in several contexts. Here we give a construction to calculate a...
FCT
2007
Springer
14 years 1 months ago
2007
Springer
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether S is a semigroup or ...
ICRA
2007
IEEE
14 years 2 months ago
2007
IEEE
— One of the most important problems in Mobile Robotics is to realise the complete robot’s autonomy. In order to achieve this goal several tasks have to be accomplished. Among ...
EOR
2008
13 years 7 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...