CaltechAUTHORS
  A Caltech Library Service

Browse by Eprint ID

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
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. http://resolver.caltech.edu/CaltechAUTHORS:20090422-111344642

This list was generated on Mon Jun 26 03:42:14 2017 PDT.