828 search results - page 7 / 166 » Bounded Hairpin Completion |
COMBINATORICA
2007
13 years 7 months ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
CP
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. Many combinatorial problems encountered in practice involve constraints that require that a set of variables take distinct or equal values. The AllDifferent constraint, i...
STACS
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
DAGSTUHL
2008
13 years 9 months ago
2008
: Let IIR be the set of closed and bounded intervals of real numbers. Arithmetic in IIR can be defined via the power set IPIR of real numbers. If divisors containing zero are exclu...
LICS
2007
IEEE
14 years 1 months ago
2007
IEEE
Typing of lambda-terms in Elementary and Light Affine Logic (EAL , LAL resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL ...