<s>
In	O
computer	B-General_Concept
science	I-General_Concept
,	O
pseudopolynomial	B-Algorithm
time	I-Algorithm
number	I-Algorithm
partitioning	I-Algorithm
is	O
a	O
pseudopolynomial	B-Algorithm
time	I-Algorithm
algorithm	O
for	O
solving	O
the	O
partition	B-Algorithm
problem	I-Algorithm
.	O
</s>
<s>
The	O
problem	O
can	O
be	O
solved	O
using	O
dynamic	B-Algorithm
programming	I-Algorithm
when	O
the	O
size	O
of	O
the	O
set	O
and	O
the	O
size	O
of	O
the	O
sum	O
of	O
the	O
integers	O
in	O
the	O
set	O
are	O
not	O
too	O
big	O
to	O
render	O
the	O
storage	O
requirements	O
infeasible	O
.	O
</s>
<s>
This	O
algorithm	O
can	O
be	O
generalized	O
to	O
a	O
solution	O
for	O
the	O
subset	B-Algorithm
sum	I-Algorithm
problem	I-Algorithm
.	O
</s>
