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...
Main Authors: | Goldberg, L, Gysel, R, Lapinskas, J |
---|---|
Format: | Journal article |
Published: |
Elsevier
2016
|
Similar Items
-
Approximately Counting Locally-Optimal Structures
by: Goldberg, L, et al.
Published: (2015) -
Faster exponential-time algorithms for approximately counting independent sets
by: Goldberg, L, et al.
Published: (2021) -
Fine-grained reductions from approximate counting to decision
by: Dell, H, et al.
Published: (2018) -
The complexity of approximately counting retractions
by: Focke, J, et al.
Published: (2019) -
The complexity of approximately counting retractions
by: Focke, J, et al.
Published: (2020)