Approximately counting locally-optimal structures
In general, constructing a locally-optimal structure is a little harder than constructing an arbitrary structure, but significantly easier than constructing a globally-optimal structure. A similar situation arises in listing. In counting, most problems are #P-complete, but in approximate counting we...
| Główni autorzy: | , , |
|---|---|
| Format: | Journal article |
| Wydane: |
Elsevier
2016
|