An efficient algorithm for a special case of the set partition problem (Q3477962)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:3477962 |
scientific article; zbMATH DE number 4147513
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm for a special case of the set partition problem |
scientific article; zbMATH DE number 4147513 |
Statements
An efficient algorithm for a special case of the set partition problem (English)
0 references
1990
0 references
decision tree
0 references
deterministic finite automaton
0 references
minimization
0 references
Set Partition Problem
0 references
0.780964195728302
0 references
0.7731719613075256
0 references
0.767508864402771
0 references
0.7652980089187622
0 references
