A Caltech Library Service

Browse by Eprint ID

Number of items: 1.

Asodi, Vera and Umans, Christopher (2009) The complexity of the matroid-greedoid partition problem. Theoretical Computer Science, 410 (8-10). pp. 859-866. ISSN 0304-3975. doi:10.1016/j.tcs.2008.11.019. https://resolver.caltech.edu/CaltechAUTHORS:20090422-111344642

This list was generated on Sat Dec 3 23:18:28 2022 UTC.

CaltechAUTHORS is powered by EPrints 3.3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.