The PARTITION problem is to divide a list of positive integers into two parts so that the sums of the numbers in the two parts are equal. It is a common example of an NP-complete problem, often useful in proving that other problems are NP-complete.
for dividing a big computer (e.g. a mainframe) into several independent virtual computers, see also LPAR, IBM mainframe, Sun E10.000, HP-UX. Some vendors (e.g. Sun) uses the term domain instead of partition.
This is a disambiguation page; that is, one that just points to other pages that might otherwise have the same name. If you followed a link here, you might want to go back and fix that link to point to the appropriate specific page.