Return to search

Fast algorithms for NP-hard problems which are optimal or near-optimal with probability one

Thesis--University of Wisconsin--Madison. / Typescript. Vita. Description based on print version record. Includes bibliographical references (leaves 120-123).

Identiferoai:union.ndltd.org:OCLC/oai:xtcat.oclc.org:OCLCNo/615302572
Date January 1979
CreatorsTerada, Routo.
Source SetsOCLC
LanguageEnglish
Detected LanguageEnglish

Page generated in 0.0023 seconds