Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,305 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Approximation algorithm
Computational complexity theory
Constraint satisfaction problem
Decision problem
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Backward-forward reachable set splitting for state-constrained differential games
Xuhui Feng
,
M. E. Villanueva
,
B. Houska
at - Automatisierungstechnik
2019
Corpus ID: 202538686
2013
2013
Uniform distribution of generalized Kakutani’s sequences of partitions
C. Aistleitner
,
Markus Hofer
2013
Corpus ID: 73706998
We consider a generalized version of Kakutani’s splitting procedure where an arbitrary starting partition π is given and in each…
Expand
2010
2010
Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting
Jesper Nederlof
,
Johan M. M. van Rooij
International Symposium on Parameterized and…
2010
Corpus ID: 13956428
Inclusion/exclusion branching is a way to branch on requirements imposed on problems, in contrast to the classical branching on…
Expand
2009
2009
TSFS: A Novel Algorithm for Single View Co-training
Wen Zhang
,
Quan Zheng
International Joint Conference on Computational…
2009
Corpus ID: 14177029
Co-training has been validated to be effective in various applications. However, it is a challenging task to apply co-training on…
Expand
2005
2005
Parallel Bounded Property Checking with SymC
P. K. Nalla
,
R. Weiss
,
Jürgen Ruf
,
T. Kropf
,
W. Rosenstiel
2005
Corpus ID: 1890030
Today, verification of industrial size designs like multi-million gate ASICs (Application Specific Integrated Circuit) and SoC…
Expand
2003
2003
An FPT Algorithm for Set Splitting
F. Dehne
,
M. Fellows
,
Frances A. Rosamond
International Workshop on Graph-Theoretic…
2003
Corpus ID: 2102380
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…
Expand
2002
2002
The Filter-Combiner Model for Memoryless Synchronous Stream Ciphers
P. Sarkar
Annual International Cryptology Conference
2002
Corpus ID: 1772125
We introduce a new model - the Filter-Combiner model - for memoryless synchronous stream ciphers. The new model combines the best…
Expand
1999
1999
Stack-splitting : A Simple Technique for Implementing Or-parallelismand And-parallelism on Distributed Machines 1
G. Gupta
,
Enrico Pontelli
1999
Corpus ID: 14282993
And then Krishna held up a twig, pointed it towards Bhima, and split it through the middle. Abstract: We study the problem of…
Expand
1999
1999
Index Set Splitting Based on the Polytope Model
B. Lehner
,
C. Lengauer
,
M. Griebl
,
D. Februar
1999
Corpus ID: 115552545
1988
1988
A structural approach to finding the point correspondences between two frames
Jin-Chang Cheng
,
H. Don
Proceedings. IEEE International Conference on…
1988
Corpus ID: 8509331
A recursive-descent tree-traversal algorithm is presented to find the point correspondences between two frames. Given two sets of…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required