281 search results - page 27 / 57 » The Complexity of Planar Counting Problems |
ISAAC
1998
Springer
14 years 41 min ago
1998
Springer
Abstract. A fundamental problem in computational biology is the determination of the correct species tree for a set of taxa given a set of possibly contradictory gene trees. In rec...
CORR
2009
Springer
13 years 5 months ago
2009
Springer
The past research on the state complexity of operations on regular languages is examined, and a new approach based on an old method (derivatives of regular expressions) is presente...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
LATA
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we investigate the computational complexity of knot theoretic problems and show upper and lower bounds for planarity problem of signed and unsigned knot diagrams repr...
TCS
2010
13 years 6 months ago
2010
Iterative Compression has recently led to a number of breakthroughs in parameterized complexity. Here, we show that the technique can also be useful in the design of exact exponen...