4066 search results - page 74 / 814 » Almost Complete Sets |
LPNMR
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. Most complete answer set solvers are based on DPLL. One of the constraint propagation methods is the so-called lookahead, which has been somewhat controversial, due to it...
COMBINATORICS
2006
13 years 10 months ago
2006
A proper edge colouring of a graph is neighbour-distinguishing if for all pairs of adjacent vertices v, w the set of colours appearing on the edges incident with v is not equal to...
ARSCOM
2004
13 years 10 months ago
2004
The domatic number of a graph G is the maximum number of dominating sets into which the vertex set of G can be partitioned. We show that the domatic number of a random r-regular g...
MFCS
2005
Springer
14 years 3 months ago
2005
Springer
We show the following results regarding complete sets. • NP-complete sets and PSPACE-complete sets are many-one autoreducible. • Complete sets of any level of PH, MODPH, or th...
EUSFLAT
2003
13 years 11 months ago
2003
In this article we propose a new measure of similarity for intuitionistic fuzzy sets. The proposed measure takes into account not only a pure distance between elements but measure...