default search action

combined dblp search
author search
venue search
publication search

ask others

"Computational Complexity of Discrete Problems (Dagstuhl Seminar 23111)."

Anna Gál et al. (2023)

> Home

Details and statistics

DOI: 10.4230/DAGREP.13.3.17

access: open

type: Informal or Other Publication

metadata version: 2023-10-20

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dagstuhl-reports/GalMSTP23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dagstuhl-reports/GalMSTP23
Anna Gál, Meena Mahajan, Rahul Santhanam, Till Tantau, Manaswi Paraashar:
Computational Complexity of Discrete Problems (Dagstuhl Seminar 23111). Dagstuhl Reports 13(3): 17-31 (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.