Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Partition_problem> ?p ?o. }
Showing items 1 to 37 of
37
with 100 items per page.
- Partition_problem abstract "In computer science, the partition problem is the task of deciding whether a given multiset S of positive integers can be partitioned into two subsets S1 and S2 such that the sum of the numbers in S1 equals the sum of the numbers in S2. Although the partition problem is NP-complete, there is a pseudo-polynomial time dynamic programming solution, and there are heuristics that solve the problem in many instances, either optimally or approximately. For this reason, it has been called "The Easiest Hard Problem".There is an optimization version of the partition problem, which is to partition the multiset S into two subsets S1, S2 such that the difference between the sum of elements in S1 and the sum of elements in S2 is minimized.".
- Partition_problem wikiPageExternalLink ?id=4YD6AxV95zEC&pg=PA125.
- Partition_problem wikiPageExternalLink summary?doi=10.1.1.2.4475.
- Partition_problem wikiPageExternalLink summary?doi=10.1.1.89.9577.
- Partition_problem wikiPageExternalLink summary?doi=10.1.1.90.993.
- Partition_problem wikiPageExternalLink 0824-7935.0006.
- Partition_problem wikiPageExternalLink p4281.
- Partition_problem wikiPageExternalLink the-easiest-hard-problem.
- Partition_problem wikiPageID "3269567".
- Partition_problem wikiPageRevisionID "602413355".
- Partition_problem hasPhotoCollection Partition_problem.
- Partition_problem subject Category:NP-complete_problems.
- Partition_problem type Abstraction100002137.
- Partition_problem type Attribute100024264.
- Partition_problem type Condition113920835.
- Partition_problem type Difficulty114408086.
- Partition_problem type NP-completeProblems.
- Partition_problem type Problem114410605.
- Partition_problem type State100024720.
- Partition_problem comment "In computer science, the partition problem is the task of deciding whether a given multiset S of positive integers can be partitioned into two subsets S1 and S2 such that the sum of the numbers in S1 equals the sum of the numbers in S2. Although the partition problem is NP-complete, there is a pseudo-polynomial time dynamic programming solution, and there are heuristics that solve the problem in many instances, either optimally or approximately.".
- Partition_problem label "Partitieprobleem".
- Partition_problem label "Partition problem".
- Partition_problem label "Partitionsproblem".
- Partition_problem label "Problem podziału".
- Partition_problem label "Problema de la partición".
- Partition_problem sameAs Problém_dvou_loupežníků.
- Partition_problem sameAs Partitionsproblem.
- Partition_problem sameAs Problema_de_la_partición.
- Partition_problem sameAs 분할_문제.
- Partition_problem sameAs Partitieprobleem.
- Partition_problem sameAs Problem_podziału.
- Partition_problem sameAs m.092flg.
- Partition_problem sameAs Q1065968.
- Partition_problem sameAs Q1065968.
- Partition_problem sameAs Partition_problem.
- Partition_problem wasDerivedFrom Partition_problem?oldid=602413355.
- Partition_problem isPrimaryTopicOf Partition_problem.