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

Swastik Kopparty et al. (2025)

> Home

Details and statistics

DOI: 10.4230/DAGREP.15.3.56

access: open

type: Informal or Other Publication

metadata version: 2025-10-17

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dagstuhl-reports/KoppartyMSTM25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dagstuhl-reports/KoppartyMSTM25
Swastik Kopparty, Meena Mahajan, Rahul Santhanam, Till Tantau, Ian Mertz:
Computational Complexity of Discrete Problems (Dagstuhl Seminar 25111). Dagstuhl Reports 15(3): 56-76 (2025)

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.