Fast algorithms for NP-hard problems which are optimal or near-optimal with probability one
| Autor: | Terada, Routo. |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 1979 |
| Předmět: | |
| Popis: | Thesis--University of Wisconsin--Madison. Typescript. Vita. Description based on print version record. Includes bibliographical references (leaves 120-123). |
| Databáze: | Networked Digital Library of Theses & Dissertations |
| Externí odkaz: |
|