Skip to search formSkip to main contentSkip to account menu

Set splitting problem

Known as: Max Set Splitting, Max set splitting problem, Set Splitting 
In computational complexity theory, the Set Splitting problem is the following decision problem: given a family F of subsets of a finite set S… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
We consider a generalized version of Kakutani’s splitting procedure where an arbitrary starting partition π is given and in each… 
2010
2010
Inclusion/exclusion branching is a way to branch on requirements imposed on problems, in contrast to the classical branching on… 
2009
2009
Co-training has been validated to be effective in various applications. However, it is a challenging task to apply co-training on… 
2005
2005
Today, verification of industrial size designs like multi-million gate ASICs (Application Specific Integrated Circuit) and SoC… 
2003
2003
An FPT algorithm with a running time of O(n 4 + 2 O(k) n 2.5) is described for the Set Splitting problem, parameterized by the… 
2002
2002
We introduce a new model - the Filter-Combiner model - for memoryless synchronous stream ciphers. The new model combines the best… 
1999
1999
And then Krishna held up a twig, pointed it towards Bhima, and split it through the middle. Abstract: We study the problem of… 
1988
1988
A recursive-descent tree-traversal algorithm is presented to find the point correspondences between two frames. Given two sets of…