1242 search results - page 105 / 249 » A Computational Complexity Theory in Membrane Computing |
LATA
2009
Springer
15 years 4 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...
ISSAC
2005
Springer
15 years 3 months ago
2005
Springer
We present lifting techniques for triangular decompositions of zero-dimensional varieties, that extend the range of the previous methods. We discuss complexity aspects, and report...
COMPGEOM
2005
ACM
14 years 12 months ago
2005
ACM
We initiate the study of exact geometric algorithms that require limited storage and make only a small number of passes over the input. Fundamental problems such as lowdimensional...
DCG
2010
14 years 7 months ago
2010
We show that any family of sets uniformly definable in an ominimal structure has an extended compression scheme of size equal to the number of parameters in the defining formula. ...
115
click to vote
ESOP
2004
Springer
15 years 3 months ago
2004
Springer
The Ambient calculus is a successful model of distributed, mobile computation, and has been the vehicle of new ideas for resource access control. Mobility types have been used to e...