"On the Node-Averaged Complexity of Locally Checkable Problems on Trees."

Alkida Balliu et al. (2023)

> Home

Details and statistics

DOI: 10.48550/ARXIV.2308.04251

access: open

type: Informal or Other Publication

metadata version: 2023-08-22

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2308-04251
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2308-04251
Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti, Gustav Schmid:
On the Node-Averaged Complexity of Locally Checkable Problems on Trees. CoRR abs/2308.04251 (2023)

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.