Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Set_splitting_problem> ?p ?o }
Showing triples 1 to 33 of
33
with 100 triples per page.
- Set_splitting_problem abstract "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 F is completely in S1 or S2. Set Splitting is one of Garey&Johnson's classical NP-complete problems.".
- Set_splitting_problem wikiPageID "20751508".
- Set_splitting_problem wikiPageLength "4484".
- Set_splitting_problem wikiPageOutDegree "14".
- Set_splitting_problem wikiPageRevisionID "704469704".
- Set_splitting_problem wikiPageWikiLink APX.
- Set_splitting_problem wikiPageWikiLink Approximation_algorithm.
- Set_splitting_problem wikiPageWikiLink Category:Computational_problems.
- Set_splitting_problem wikiPageWikiLink Category:NP-complete_problems.
- Set_splitting_problem wikiPageWikiLink Computational_complexity_theory.
- Set_splitting_problem wikiPageWikiLink Computers_and_Intractability.
- Set_splitting_problem wikiPageWikiLink Constraint_satisfaction_problem.
- Set_splitting_problem wikiPageWikiLink Decision_problem.
- Set_splitting_problem wikiPageWikiLink Graph_coloring.
- Set_splitting_problem wikiPageWikiLink Hypergraph.
- Set_splitting_problem wikiPageWikiLink Maximum_cut.
- Set_splitting_problem wikiPageWikiLink NP-completeness.
- Set_splitting_problem wikiPageWikiLink Optimization_problem.
- Set_splitting_problem wikiPageWikiLink Parameterized_complexity.
- Set_splitting_problem wikiPageWikiLinkText "Set splitting problem".
- Set_splitting_problem subject Category:Computational_problems.
- Set_splitting_problem subject Category:NP-complete_problems.
- Set_splitting_problem hypernym Problem.
- Set_splitting_problem type Disease.
- Set_splitting_problem comment "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 F is completely in S1 or S2. Set Splitting is one of Garey&Johnson's classical NP-complete problems.".
- Set_splitting_problem label "Set splitting problem".
- Set_splitting_problem sameAs Q7456300.
- Set_splitting_problem sameAs Problema_de_la_división_de_un_conjunto.
- Set_splitting_problem sameAs Problema_da_divisão_de_conjuntos.
- Set_splitting_problem sameAs m.05841ql.
- Set_splitting_problem sameAs Q7456300.
- Set_splitting_problem wasDerivedFrom Set_splitting_problem?oldid=704469704.
- Set_splitting_problem isPrimaryTopicOf Set_splitting_problem.