"The complexity of approximating averages on bounded-degree graphs."

Andreas Galanis, Daniel Stefankovic, Eric Vigoda (2020)

> Home

Details and statistics

DOI: 10.1109/FOCS46700.2020.00127

access: closed

type: Conference or Workshop Paper

metadata version: 2021-01-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/focs/GalanisSV20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/GalanisSV20
Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
The complexity of approximating averages on bounded-degree graphs. FOCS 2020: 1345-1355

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.