We investigate the existence of some large sets of size nine.
We analysed the performance of proposed architecture for different modulo sets of size up to ten.
The most outstanding result proved with this technique is a k-1 hardness result for the hitting set problem with sets of size k.
In an array it performs in-place, recursively dividing the candidate values into sets of size b, from which exact medians are selected for the next phase.
We consider the problem max csp over multi-valued domains with variables ranging over sets of size si⩽s and constraints involving kj⩽k variables.
We employed congruent points sets of size N = 4.
There are nine other bond sets of size four leading to ten synthesis plans.
From this, the number of non-isomorphic bond sets of a certain size can be calculated by a straightforward application of Pólya's Enumeration Theorem [33]: decalin has four non-isomorphic bond sets of size one, 182 non-isomorphic bond sets of size two, 47 non-isomorphic bond sets of size three, and 92 non-isomorphic bond sets of size four.
So, the sum of weight of all possible sets of size is.
Fig. 1 Example synthesis plans for decalin for two different bond sets of size four.
Three algorithms (AC, RS, GA) work in reasonable time for data sets of size N = 5000 but require already several minutes for the Birch sets of size N = 100,000.
