Pseudopolynomial time number partitioning
id:
pseudopolynomial-time-number-partitioning-258-3271763
title:
Pseudopolynomial time number partitioning
text:
In computer science, pseudopolynomial time number partitioning is a pseudopolynomial time algorithm for solving the partition problem. The problem can be solved using dynamic programming when the size of the set and the size of the sum of the integers in the set are not too big to render the storage requirements infeasible. Suppose the input to the algorithm is a multiset S of cardinality N : Let K be the sum of all elements in S. That is: K = x1 + ... + xN. We will build an algorithm that deter
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Pseudopolynomial_time_number_partitioning
date created:
date modified:
2020-11-19T19:39:04Z
main entity:
{"identifier":"Q104871770","url":"https://www.wikidata.org/entity/Q104871770"}
image:
fields total:
13
integrity:
13