2446 search results - page 188 / 490 » Choiceless Polynomial Time |
ISAAC
2007
Springer
14 years 2 months ago
2007
Springer
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...
SPIRE
2007
Springer
14 years 2 months ago
2007
Springer
The Longest Common Subsequence (LCS) is a well studied problem, having a wide range of implementations. Its motivation is in comparing strings. It has long been of interest to dev...
STACS
2007
Springer
14 years 2 months ago
2007
Springer
We study the following problem. Given a weighted planar graph G, assign labels L(v) to vertices so that given L(u), L(v) and L(x) for x ∈ X for any X ⊂ V (G), compute the dist...
TGC
2007
Springer
14 years 2 months ago
2007
Springer
Many techniques exist for statically computing properties of the evolution of processes expressed in process algebras. Static analysis has shown how to obtain useful results that c...
WABI
2007
Springer
14 years 2 months ago
2007
Springer
The aim of the motif recognition problem is to detect a set of mutually similar subsequences within a collection of biological sequences. The weak motif recognition problem on DNA ...