876 search results - page 37 / 176 » New Results for the Martin Polynomial |
BMCBI
2006
13 years 8 months ago
2006
Background: The main aim of this study was to develop and implement an algorithm for the rapid, accurate and automated identification of paths leading from buried protein clefts, ...
FLOPS
2010
Springer
14 years 3 months ago
2010
Springer
Recently, many techniques have been introduced that allow the (automated) classification of the runtime complexity of term rewrite systems (TRSs for short). In this paper we show ...
FOCS
2003
IEEE
14 years 2 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
CP
2006
Springer
14 years 12 days ago
2006
Springer
Many combinatorial problems, such as car sequencing and rostering, feature sequence constraints, restricting the number of occurrences of certain values in every subsequence of a g...
CONSTRAINTS
2008
13 years 8 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...