Generating all subsets of a finite set with disjoint unions
dc.contributor.author | Ellis, D | en_US |
dc.contributor.author | Sudakov, B | en_US |
dc.date.accessioned | 2016-09-19T15:55:57Z | |
dc.date.issued | 2011-11-01 | en_US |
dc.date.submitted | 2016-08-29T15:45:46.444Z | |
dc.identifier.issn | 0097-3165 | en_US |
dc.identifier.uri | http://qmro.qmul.ac.uk/xmlui/handle/123456789/15441 | |
dc.format.extent | 2319 - 2345 | en_US |
dc.relation.ispartof | Journal of Combinatorial Theory Series A | en_US |
dc.rights | doi:10.1016/j.jcta.2011.06.003 | |
dc.title | Generating all subsets of a finite set with disjoint unions | en_US |
dc.type | Article | |
dc.rights.holder | © 2011 Elsevier Inc | |
dc.identifier.doi | 10.1016/j.jcta.2011.06.003 | en_US |
pubs.issue | 8 | en_US |
pubs.notes | No embargo | en_US |
pubs.volume | 118 | en_US |
Files in this item
Files | Size | Format | View |
---|---|---|---|
There are no files associated with this item. |
This item appears in the following Collection(s)
-
Applied Mathematics [145]