{"version":"1.0","type":"link","title":"Set splitting problem - Newikis","description":"In computational complexity theory, the set splitting problem is the following decision problem: given a family F of subsets of a finite set S, decide whether there exists a partition of S into two subsets S1, S2 such that all elements of F are split by this partition, i.e., none of the elements of…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/f/fc/Set_splitting.svg/1280px-Set_splitting.svg.png","thumbnail_width":1280,"thumbnail_height":1551}